./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for overflows
Using default analysis
Version 1dbac8bc
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/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 a7af5709195f6c1eec73f2559f8e654af4840835
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(OVERFLOW)
--- Real Ultimate output ---
This is Ultimate 0.1.23-1dbac8b
[2018-11-10 09:30:31,334 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-10 09:30:31,335 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-10 09:30:31,344 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-10 09:30:31,344 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-10 09:30:31,345 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-10 09:30:31,346 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-10 09:30:31,347 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-10 09:30:31,348 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-10 09:30:31,348 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-10 09:30:31,349 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-10 09:30:31,349 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-10 09:30:31,350 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-10 09:30:31,351 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-10 09:30:31,351 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-10 09:30:31,351 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-10 09:30:31,352 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-10 09:30:31,353 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-10 09:30:31,355 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-10 09:30:31,356 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-10 09:30:31,357 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-10 09:30:31,358 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-10 09:30:31,359 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-10 09:30:31,359 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-10 09:30:31,359 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-10 09:30:31,360 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-10 09:30:31,360 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-10 09:30:31,360 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-10 09:30:31,361 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-10 09:30:31,363 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-10 09:30:31,363 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-10 09:30:31,363 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-10 09:30:31,364 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-10 09:30:31,364 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-10 09:30:31,364 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-10 09:30:31,365 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-10 09:30:31,365 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf
[2018-11-10 09:30:31,373 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-10 09:30:31,373 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-10 09:30:31,374 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-10 09:30:31,374 INFO  L133        SettingsManager]:  * User list type=DISABLED
[2018-11-10 09:30:31,374 INFO  L133        SettingsManager]:  * calls to implemented procedures=false
[2018-11-10 09:30:31,374 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-11-10 09:30:31,374 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-11-10 09:30:31,374 INFO  L133        SettingsManager]:  * Abstract domain=CompoundDomain
[2018-11-10 09:30:31,374 INFO  L133        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2018-11-10 09:30:31,375 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-11-10 09:30:31,375 INFO  L133        SettingsManager]:  * Interval Domain=false
[2018-11-10 09:30:31,375 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-10 09:30:31,375 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Check absence of signed integer overflows=true
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-10 09:30:31,376 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-10 09:30:31,377 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-10 09:30:31,377 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-10 09:30:31,377 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-10 09:30:31,377 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-10 09:30:31,377 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-10 09:30:31,377 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-10 09:30:31,377 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-10 09:30:31,378 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-10 09:30:31,378 INFO  L133        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2018-11-10 09:30:31,378 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-10 09:30:31,378 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-10 09:30:31,378 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-10 09:30:31,378 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_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/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 -> a7af5709195f6c1eec73f2559f8e654af4840835
[2018-11-10 09:30:31,403 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-10 09:30:31,412 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-10 09:30:31,415 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-10 09:30:31,416 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-10 09:30:31,416 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-10 09:30:31,417 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c
[2018-11-10 09:30:31,462 INFO  L218              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/data/20afbd842/dcad161998b04129bf0b91e45c420fd9/FLAG1a364dc54
[2018-11-10 09:30:31,850 INFO  L298              CDTParser]: Found 1 translation units.
[2018-11-10 09:30:31,850 INFO  L158              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c
[2018-11-10 09:30:31,854 INFO  L346              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/data/20afbd842/dcad161998b04129bf0b91e45c420fd9/FLAG1a364dc54
[2018-11-10 09:30:31,863 INFO  L354              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/data/20afbd842/dcad161998b04129bf0b91e45c420fd9
[2018-11-10 09:30:31,864 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-10 09:30:31,865 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-10 09:30:31,866 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-10 09:30:31,866 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-10 09:30:31,869 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-10 09:30:31,870 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:31,872 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd2abbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31, skipping insertion in model container
[2018-11-10 09:30:31,872 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:31,878 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-10 09:30:31,889 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-11-10 09:30:31,977 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 09:30:31,979 INFO  L189         MainTranslator]: Completed pre-run
[2018-11-10 09:30:31,989 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 09:30:31,998 INFO  L193         MainTranslator]: Completed translation
[2018-11-10 09:30:31,999 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31 WrapperNode
[2018-11-10 09:30:31,999 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-10 09:30:31,999 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-10 09:30:31,999 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-10 09:30:32,000 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-10 09:30:32,005 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,008 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,011 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-10 09:30:32,011 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-10 09:30:32,011 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-10 09:30:32,011 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-10 09:30:32,016 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,016 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,017 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,017 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,019 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,021 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,021 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
[2018-11-10 09:30:32,023 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-10 09:30:32,023 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-10 09:30:32,023 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-10 09:30:32,023 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-10 09:30:32,023 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-10 09:30:32,094 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-10 09:30:32,094 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-10 09:30:32,094 INFO  L130     BoogieDeclarations]: Found specification of procedure mult
[2018-11-10 09:30:32,094 INFO  L138     BoogieDeclarations]: Found implementation of procedure mult
[2018-11-10 09:30:32,095 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-10 09:30:32,095 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-10 09:30:32,095 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-10 09:30:32,095 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-10 09:30:32,259 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-10 09:30:32,259 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:30:32 BoogieIcfgContainer
[2018-11-10 09:30:32,259 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-10 09:30:32,260 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-10 09:30:32,260 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-10 09:30:32,262 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-10 09:30:32,262 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:30:31" (1/3) ...
[2018-11-10 09:30:32,263 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702b26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:30:32, skipping insertion in model container
[2018-11-10 09:30:32,263 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:30:31" (2/3) ...
[2018-11-10 09:30:32,264 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5702b26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:30:32, skipping insertion in model container
[2018-11-10 09:30:32,264 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:30:32" (3/3) ...
[2018-11-10 09:30:32,265 INFO  L112   eAbstractionObserver]: Analyzing ICFG MultCommutative_false-no-overflow.c
[2018-11-10 09:30:32,274 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-10 09:30:32,280 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations.
[2018-11-10 09:30:32,294 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2018-11-10 09:30:32,323 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-10 09:30:32,323 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-10 09:30:32,324 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-10 09:30:32,324 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-10 09:30:32,324 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-10 09:30:32,324 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-10 09:30:32,324 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-10 09:30:32,324 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-10 09:30:32,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 38 states.
[2018-11-10 09:30:32,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-11-10 09:30:32,347 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:32,347 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:32,349 INFO  L424      AbstractCegarLoop]: === Iteration 1 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:32,353 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:32,353 INFO  L82        PathProgramCache]: Analyzing trace with hash 1930860990, now seen corresponding path program 1 times
[2018-11-10 09:30:32,355 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:32,384 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,384 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:32,385 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,385 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:32,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:32,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:32,491 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:32,491 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-10 09:30:32,491 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:32,496 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:32,506 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:32,506 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:32,508 INFO  L87              Difference]: Start difference. First operand 38 states. Second operand 5 states.
[2018-11-10 09:30:32,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:32,618 INFO  L93              Difference]: Finished difference Result 85 states and 104 transitions.
[2018-11-10 09:30:32,618 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-11-10 09:30:32,619 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2018-11-10 09:30:32,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:32,625 INFO  L225             Difference]: With dead ends: 85
[2018-11-10 09:30:32,625 INFO  L226             Difference]: Without dead ends: 46
[2018-11-10 09:30:32,628 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-10 09:30:32,638 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-11-10 09:30:32,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41.
[2018-11-10 09:30:32,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-11-10 09:30:32,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions.
[2018-11-10 09:30:32,655 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11
[2018-11-10 09:30:32,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:32,655 INFO  L481      AbstractCegarLoop]: Abstraction has 41 states and 49 transitions.
[2018-11-10 09:30:32,655 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:32,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions.
[2018-11-10 09:30:32,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-11-10 09:30:32,656 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:32,656 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:32,656 INFO  L424      AbstractCegarLoop]: === Iteration 2 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:32,656 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:32,656 INFO  L82        PathProgramCache]: Analyzing trace with hash -272844401, now seen corresponding path program 1 times
[2018-11-10 09:30:32,657 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:32,657 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,657 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:32,657 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,658 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:32,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:32,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:32,692 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:32,692 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-10 09:30:32,693 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:32,694 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:32,694 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:32,694 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:32,694 INFO  L87              Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states.
[2018-11-10 09:30:32,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:32,789 INFO  L93              Difference]: Finished difference Result 62 states and 76 transitions.
[2018-11-10 09:30:32,790 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-11-10 09:30:32,790 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2018-11-10 09:30:32,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:32,791 INFO  L225             Difference]: With dead ends: 62
[2018-11-10 09:30:32,791 INFO  L226             Difference]: Without dead ends: 60
[2018-11-10 09:30:32,792 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-10 09:30:32,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-11-10 09:30:32,798 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55.
[2018-11-10 09:30:32,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-11-10 09:30:32,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions.
[2018-11-10 09:30:32,800 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12
[2018-11-10 09:30:32,800 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:32,800 INFO  L481      AbstractCegarLoop]: Abstraction has 55 states and 68 transitions.
[2018-11-10 09:30:32,800 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:32,800 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions.
[2018-11-10 09:30:32,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-11-10 09:30:32,801 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:32,801 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:32,801 INFO  L424      AbstractCegarLoop]: === Iteration 3 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:32,802 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:32,802 INFO  L82        PathProgramCache]: Analyzing trace with hash 757868177, now seen corresponding path program 1 times
[2018-11-10 09:30:32,802 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:32,803 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,803 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:32,803 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,803 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:32,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:32,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:32,844 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:32,844 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-10 09:30:32,844 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:32,844 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:32,844 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:32,845 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:32,845 INFO  L87              Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 5 states.
[2018-11-10 09:30:32,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:32,918 INFO  L93              Difference]: Finished difference Result 80 states and 100 transitions.
[2018-11-10 09:30:32,918 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-11-10 09:30:32,918 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2018-11-10 09:30:32,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:32,919 INFO  L225             Difference]: With dead ends: 80
[2018-11-10 09:30:32,920 INFO  L226             Difference]: Without dead ends: 79
[2018-11-10 09:30:32,920 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2018-11-10 09:30:32,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2018-11-10 09:30:32,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70.
[2018-11-10 09:30:32,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-11-10 09:30:32,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions.
[2018-11-10 09:30:32,931 INFO  L78                 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 17
[2018-11-10 09:30:32,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:32,931 INFO  L481      AbstractCegarLoop]: Abstraction has 70 states and 88 transitions.
[2018-11-10 09:30:32,931 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:32,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions.
[2018-11-10 09:30:32,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-11-10 09:30:32,932 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:32,932 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:32,932 INFO  L424      AbstractCegarLoop]: === Iteration 4 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:32,932 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:32,932 INFO  L82        PathProgramCache]: Analyzing trace with hash 809703757, now seen corresponding path program 1 times
[2018-11-10 09:30:32,933 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:32,933 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,933 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:32,933 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:32,933 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:32,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:32,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:32,964 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:32,964 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-10 09:30:32,964 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:32,964 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:32,964 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:32,965 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:32,965 INFO  L87              Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states.
[2018-11-10 09:30:33,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:33,025 INFO  L93              Difference]: Finished difference Result 124 states and 158 transitions.
[2018-11-10 09:30:33,026 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-11-10 09:30:33,026 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-11-10 09:30:33,026 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:33,028 INFO  L225             Difference]: With dead ends: 124
[2018-11-10 09:30:33,028 INFO  L226             Difference]: Without dead ends: 88
[2018-11-10 09:30:33,029 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-10 09:30:33,029 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2018-11-10 09:30:33,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79.
[2018-11-10 09:30:33,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2018-11-10 09:30:33,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions.
[2018-11-10 09:30:33,038 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 18
[2018-11-10 09:30:33,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:33,038 INFO  L481      AbstractCegarLoop]: Abstraction has 79 states and 100 transitions.
[2018-11-10 09:30:33,038 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:33,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions.
[2018-11-10 09:30:33,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-11-10 09:30:33,039 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:33,039 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:33,039 INFO  L424      AbstractCegarLoop]: === Iteration 5 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:33,040 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:33,040 INFO  L82        PathProgramCache]: Analyzing trace with hash -668980256, now seen corresponding path program 1 times
[2018-11-10 09:30:33,040 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:33,041 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,041 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:33,041 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,041 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:33,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:33,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:33,084 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:33,084 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-10 09:30:33,084 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:33,085 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:33,085 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:33,085 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:33,085 INFO  L87              Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states.
[2018-11-10 09:30:33,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:33,151 INFO  L93              Difference]: Finished difference Result 105 states and 134 transitions.
[2018-11-10 09:30:33,151 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-11-10 09:30:33,152 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2018-11-10 09:30:33,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:33,153 INFO  L225             Difference]: With dead ends: 105
[2018-11-10 09:30:33,153 INFO  L226             Difference]: Without dead ends: 104
[2018-11-10 09:30:33,153 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-11-10 09:30:33,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2018-11-10 09:30:33,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94.
[2018-11-10 09:30:33,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 94 states.
[2018-11-10 09:30:33,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions.
[2018-11-10 09:30:33,163 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19
[2018-11-10 09:30:33,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:33,163 INFO  L481      AbstractCegarLoop]: Abstraction has 94 states and 119 transitions.
[2018-11-10 09:30:33,163 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:33,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions.
[2018-11-10 09:30:33,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-11-10 09:30:33,164 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:33,164 INFO  L375         BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:33,164 INFO  L424      AbstractCegarLoop]: === Iteration 6 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:33,164 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:33,164 INFO  L82        PathProgramCache]: Analyzing trace with hash 2531206, now seen corresponding path program 1 times
[2018-11-10 09:30:33,164 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:33,165 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,165 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:33,165 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,165 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:33,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:33,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-11-10 09:30:33,202 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 09:30:33,202 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-10 09:30:33,202 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:33,202 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-10 09:30:33,202 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-10 09:30:33,202 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-11-10 09:30:33,202 INFO  L87              Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 5 states.
[2018-11-10 09:30:33,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:33,233 INFO  L93              Difference]: Finished difference Result 136 states and 172 transitions.
[2018-11-10 09:30:33,234 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-11-10 09:30:33,234 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2018-11-10 09:30:33,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:33,234 INFO  L225             Difference]: With dead ends: 136
[2018-11-10 09:30:33,235 INFO  L226             Difference]: Without dead ends: 62
[2018-11-10 09:30:33,235 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2018-11-10 09:30:33,235 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2018-11-10 09:30:33,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54.
[2018-11-10 09:30:33,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-11-10 09:30:33,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions.
[2018-11-10 09:30:33,241 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22
[2018-11-10 09:30:33,241 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:33,242 INFO  L481      AbstractCegarLoop]: Abstraction has 54 states and 64 transitions.
[2018-11-10 09:30:33,242 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-10 09:30:33,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions.
[2018-11-10 09:30:33,242 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-11-10 09:30:33,242 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:33,243 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:33,243 INFO  L424      AbstractCegarLoop]: === Iteration 7 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:33,243 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:33,243 INFO  L82        PathProgramCache]: Analyzing trace with hash -484323025, now seen corresponding path program 1 times
[2018-11-10 09:30:33,243 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:33,244 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,244 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:33,244 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:33,245 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:33,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 09:30:33,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 09:30:33,302 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-11-10 09:30:33,303 INFO  L194   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-11-10 09:30:33,303 INFO  L200      CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: 
[2018-11-10 09:30:33,304 INFO  L202      CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [52], [53], [54], [55], [56], [58]
[2018-11-10 09:30:33,334 INFO  L148    AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain]
[2018-11-10 09:30:33,334 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2)
[2018-11-10 09:30:33,447 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2018-11-10 09:30:33,448 INFO  L272    AbstractInterpreter]: Visited 19 different actions 49 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables.
[2018-11-10 09:30:33,453 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:33,453 INFO  L398   sIntCurrentIteration]: Generating AbsInt predicates
[2018-11-10 09:30:33,517 INFO  L227   lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 53.64% of their original sizes.
[2018-11-10 09:30:33,518 INFO  L413   sIntCurrentIteration]: Unifying AI predicates
[2018-11-10 09:30:33,611 INFO  L415   sIntCurrentIteration]: We unified 20 AI predicates to 20
[2018-11-10 09:30:33,611 INFO  L424   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2018-11-10 09:30:33,612 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-11-10 09:30:33,612 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 16
[2018-11-10 09:30:33,612 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-11-10 09:30:33,613 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-11-10 09:30:33,613 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-11-10 09:30:33,613 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2018-11-10 09:30:33,613 INFO  L87              Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 12 states.
[2018-11-10 09:30:34,290 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 09:30:34,290 INFO  L93              Difference]: Finished difference Result 76 states and 91 transitions.
[2018-11-10 09:30:34,290 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2018-11-10 09:30:34,290 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-11-10 09:30:34,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-10 09:30:34,291 INFO  L225             Difference]: With dead ends: 76
[2018-11-10 09:30:34,291 INFO  L226             Difference]: Without dead ends: 71
[2018-11-10 09:30:34,292 INFO  L605         BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380
[2018-11-10 09:30:34,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2018-11-10 09:30:34,298 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67.
[2018-11-10 09:30:34,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-11-10 09:30:34,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions.
[2018-11-10 09:30:34,299 INFO  L78                 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 21
[2018-11-10 09:30:34,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-10 09:30:34,299 INFO  L481      AbstractCegarLoop]: Abstraction has 67 states and 78 transitions.
[2018-11-10 09:30:34,299 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-11-10 09:30:34,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions.
[2018-11-10 09:30:34,300 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-11-10 09:30:34,300 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-10 09:30:34,300 INFO  L375         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 09:30:34,301 INFO  L424      AbstractCegarLoop]: === Iteration 8 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]===
[2018-11-10 09:30:34,301 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 09:30:34,301 INFO  L82        PathProgramCache]: Analyzing trace with hash -880204174, now seen corresponding path program 1 times
[2018-11-10 09:30:34,301 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-11-10 09:30:34,302 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:34,302 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 09:30:34,302 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 09:30:34,302 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-11-10 09:30:34,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 09:30:34,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 09:30:34,334 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-11-10 09:30:34,349 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:30:34 BoogieIcfgContainer
[2018-11-10 09:30:34,349 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-10 09:30:34,349 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-10 09:30:34,349 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-10 09:30:34,349 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-10 09:30:34,350 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:30:32" (3/4) ...
[2018-11-10 09:30:34,351 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-11-10 09:30:34,380 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6e0e8bc-8779-4d3e-9934-ea507b9f9aa3/bin-2019/utaipan/witness.graphml
[2018-11-10 09:30:34,380 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-10 09:30:34,381 INFO  L168              Benchmark]: Toolchain (without parser) took 2516.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 959.1 MB in the beginning and 844.3 MB in the end (delta: 114.9 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,382 INFO  L168              Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,383 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 133.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,383 INFO  L168              Benchmark]: Boogie Procedure Inliner took 11.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,383 INFO  L168              Benchmark]: Boogie Preprocessor took 11.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,383 INFO  L168              Benchmark]: RCFGBuilder took 236.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,384 INFO  L168              Benchmark]: TraceAbstraction took 2089.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.7 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,384 INFO  L168              Benchmark]: Witness Printer took 31.53 ms. Allocated memory is still 1.2 GB. Free memory was 847.7 MB in the beginning and 844.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB.
[2018-11-10 09:30:34,386 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 133.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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.61 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 11.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 236.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 2089.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.7 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB.
 * Witness Printer took 31.53 ms. Allocated memory is still 1.2 GB. Free memory was 847.7 MB in the beginning and 844.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 22]: integer overflow possible
    integer overflow possible
We found a FailurePath: 
[L26]              int m = __VERIFIER_nondet_int();
[L27]  COND FALSE  !(m < 0)
[L30]              int n = __VERIFIER_nondet_int();
[L31]  COND FALSE  !(n < 0)
       VAL         [m=1073741824, n=2]
[L34]  CALL        mult(m, n)
       VAL         [\old(m)=2, \old(n)=1073741824]
[L16]  COND FALSE  !(m < 0)
       VAL         [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824]
[L19]  COND FALSE  !(m == 0)
       VAL         [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824]
[L22]  EXPR        m - 1
       VAL         [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824]
[L22]  CALL, EXPR  mult(n, m - 1)
       VAL         [\old(m)=1, \old(n)=1073741824]
[L16]  COND FALSE  !(m < 0)
       VAL         [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824]
[L19]  COND FALSE  !(m == 0)
       VAL         [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824]
[L22]  EXPR        m - 1
       VAL         [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824]
[L22]  CALL, EXPR  mult(n, m - 1)
       VAL         [\old(m)=0, \old(n)=1073741824]
[L16]  COND FALSE  !(m < 0)
       VAL         [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824]
[L19]  COND TRUE   m == 0
[L20]  RET         return 0;
       VAL         [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824]
[L22]  EXPR        mult(n, m - 1)
       VAL         [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824]
[L22]  EXPR        n + mult(n, m - 1)
[L22]  RET         return n + mult(n, m - 1);
[L22]  EXPR        mult(n, m - 1)
       VAL         [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824]
[L22]              n + mult(n, m - 1)
       VAL         [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 38 locations, 6 error locations. UNSAFE Result, 2.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 259 SDslu, 436 SDs, 0 SdLazy, 265 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred 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, 1 AbstIntIterations, 1 AbstIntStrong, 0.8958333333333333 AbsIntWeakeningRatio, 0.6 AbsIntAvgWeakeningVarsNumRemoved, 17.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 3843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 14/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...