./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 1dbac8bc
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )

 --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.1.23-1dbac8b
[2018-10-26 21:58:05,145 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-10-26 21:58:05,146 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-26 21:58:05,155 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-26 21:58:05,156 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-26 21:58:05,156 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-26 21:58:05,157 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-26 21:58:05,159 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-26 21:58:05,160 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-26 21:58:05,161 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-26 21:58:05,162 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-26 21:58:05,162 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-26 21:58:05,163 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-26 21:58:05,164 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-26 21:58:05,164 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-26 21:58:05,165 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-26 21:58:05,166 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-26 21:58:05,167 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-26 21:58:05,169 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-26 21:58:05,170 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-26 21:58:05,171 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-26 21:58:05,172 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-26 21:58:05,174 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-26 21:58:05,174 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-26 21:58:05,174 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-26 21:58:05,175 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-26 21:58:05,176 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-26 21:58:05,177 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-26 21:58:05,178 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-26 21:58:05,179 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-26 21:58:05,179 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-26 21:58:05,179 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-26 21:58:05,179 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-26 21:58:05,180 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-26 21:58:05,181 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-26 21:58:05,181 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-10-26 21:58:05,182 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf
[2018-10-26 21:58:05,192 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-10-26 21:58:05,192 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-26 21:58:05,193 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-26 21:58:05,193 INFO  L133        SettingsManager]:  * User list type=DISABLED
[2018-10-26 21:58:05,193 INFO  L133        SettingsManager]:  * calls to implemented procedures=false
[2018-10-26 21:58:05,193 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-10-26 21:58:05,194 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-10-26 21:58:05,194 INFO  L133        SettingsManager]:  * Abstract domain=CompoundDomain
[2018-10-26 21:58:05,194 INFO  L133        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2018-10-26 21:58:05,194 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-10-26 21:58:05,194 INFO  L133        SettingsManager]:  * Interval Domain=false
[2018-10-26 21:58:05,195 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-10-26 21:58:05,195 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-26 21:58:05,196 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-10-26 21:58:05,197 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-10-26 21:58:05,198 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-10-26 21:58:05,198 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-26 21:58:05,199 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-26 21:58:05,199 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-26 21:58:05,199 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_81c64992-1026-4f11-b144-c412192be754/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 ! call(__VERIFIER_error())) )


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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c
[2018-10-26 21:58:05,228 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-26 21:58:05,238 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-26 21:58:05,241 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-26 21:58:05,242 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-10-26 21:58:05,243 INFO  L276        PluginConnector]: CDTParser initialized
[2018-10-26 21:58:05,243 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-10-26 21:58:05,289 INFO  L218              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/data/2a605825d/3f54038b264349c983abfac3cefba18b/FLAG1432caaae
[2018-10-26 21:58:05,665 INFO  L298              CDTParser]: Found 1 translation units.
[2018-10-26 21:58:05,666 INFO  L158              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-10-26 21:58:05,672 INFO  L346              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/data/2a605825d/3f54038b264349c983abfac3cefba18b/FLAG1432caaae
[2018-10-26 21:58:05,683 INFO  L354              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/data/2a605825d/3f54038b264349c983abfac3cefba18b
[2018-10-26 21:58:05,686 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-26 21:58:05,687 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-10-26 21:58:05,687 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-10-26 21:58:05,687 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-10-26 21:58:05,691 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-10-26 21:58:05,692 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,694 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb7a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05, skipping insertion in model container
[2018-10-26 21:58:05,695 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,703 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-10-26 21:58:05,721 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-10-26 21:58:05,846 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 21:58:05,849 INFO  L189         MainTranslator]: Completed pre-run
[2018-10-26 21:58:05,869 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 21:58:05,882 INFO  L193         MainTranslator]: Completed translation
[2018-10-26 21:58:05,882 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05 WrapperNode
[2018-10-26 21:58:05,882 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-10-26 21:58:05,883 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-26 21:58:05,883 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-26 21:58:05,883 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-26 21:58:05,892 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,897 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,903 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-26 21:58:05,903 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-26 21:58:05,903 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-26 21:58:05,903 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-10-26 21:58:05,912 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,912 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,913 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,913 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,917 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,922 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,923 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
[2018-10-26 21:58:05,924 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-26 21:58:05,925 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-26 21:58:05,925 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-10-26 21:58:05,925 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-10-26 21:58:05,926 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/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-10-26 21:58:06,024 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-10-26 21:58:06,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-10-26 21:58:06,028 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-26 21:58:06,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-26 21:58:06,028 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-10-26 21:58:06,028 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-10-26 21:58:06,028 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2018-10-26 21:58:06,029 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2018-10-26 21:58:06,511 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-26 21:58:06,511 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:58:06 BoogieIcfgContainer
[2018-10-26 21:58:06,511 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-26 21:58:06,512 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-26 21:58:06,512 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-10-26 21:58:06,515 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-10-26 21:58:06,515 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:58:05" (1/3) ...
[2018-10-26 21:58:06,516 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710c99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:58:06, skipping insertion in model container
[2018-10-26 21:58:06,516 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:58:05" (2/3) ...
[2018-10-26 21:58:06,516 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710c99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:58:06, skipping insertion in model container
[2018-10-26 21:58:06,516 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:58:06" (3/3) ...
[2018-10-26 21:58:06,518 INFO  L112   eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i
[2018-10-26 21:58:06,526 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-26 21:58:06,535 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-10-26 21:58:06,558 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-10-26 21:58:06,598 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-10-26 21:58:06,598 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-10-26 21:58:06,598 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-26 21:58:06,598 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-26 21:58:06,598 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-26 21:58:06,599 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-10-26 21:58:06,599 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-26 21:58:06,599 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-26 21:58:06,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states.
[2018-10-26 21:58:06,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-10-26 21:58:06,629 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:06,630 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:06,634 INFO  L424      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:06,640 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:06,640 INFO  L82        PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times
[2018-10-26 21:58:06,642 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:06,689 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:06,689 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:06,689 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:06,689 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:06,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:06,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:06,750 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:06,750 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-26 21:58:06,750 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:06,755 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-10-26 21:58:06,767 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-10-26 21:58:06,768 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-10-26 21:58:06,770 INFO  L87              Difference]: Start difference. First operand 28 states. Second operand 2 states.
[2018-10-26 21:58:06,796 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:06,796 INFO  L93              Difference]: Finished difference Result 39 states and 52 transitions.
[2018-10-26 21:58:06,797 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-10-26 21:58:06,798 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2018-10-26 21:58:06,798 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:06,804 INFO  L225             Difference]: With dead ends: 39
[2018-10-26 21:58:06,804 INFO  L226             Difference]: Without dead ends: 22
[2018-10-26 21:58:06,807 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-10-26 21:58:06,818 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-10-26 21:58:06,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2018-10-26 21:58:06,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2018-10-26 21:58:06,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions.
[2018-10-26 21:58:06,835 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10
[2018-10-26 21:58:06,835 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:06,835 INFO  L481      AbstractCegarLoop]: Abstraction has 22 states and 32 transitions.
[2018-10-26 21:58:06,835 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-10-26 21:58:06,835 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions.
[2018-10-26 21:58:06,836 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-10-26 21:58:06,836 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:06,836 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:06,836 INFO  L424      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:06,837 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:06,837 INFO  L82        PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times
[2018-10-26 21:58:06,837 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:06,838 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:06,838 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:06,838 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:06,838 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:06,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:06,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:06,924 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:06,924 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:06,925 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:06,926 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:06,926 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:06,926 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 21:58:06,926 INFO  L87              Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states.
[2018-10-26 21:58:07,050 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:07,050 INFO  L93              Difference]: Finished difference Result 30 states and 41 transitions.
[2018-10-26 21:58:07,050 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:07,050 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2018-10-26 21:58:07,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:07,052 INFO  L225             Difference]: With dead ends: 30
[2018-10-26 21:58:07,052 INFO  L226             Difference]: Without dead ends: 25
[2018-10-26 21:58:07,054 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 21:58:07,054 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2018-10-26 21:58:07,059 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24.
[2018-10-26 21:58:07,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2018-10-26 21:58:07,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions.
[2018-10-26 21:58:07,061 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11
[2018-10-26 21:58:07,061 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:07,061 INFO  L481      AbstractCegarLoop]: Abstraction has 24 states and 34 transitions.
[2018-10-26 21:58:07,061 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:07,061 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions.
[2018-10-26 21:58:07,063 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:07,063 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:07,063 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:07,064 INFO  L424      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:07,064 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:07,064 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times
[2018-10-26 21:58:07,064 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:07,065 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:07,065 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:07,065 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:07,065 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:07,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:07,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:07,189 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:07,190 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:07,190 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:07,190 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:07,190 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:07,190 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 21:58:07,191 INFO  L87              Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states.
[2018-10-26 21:58:07,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:07,537 INFO  L93              Difference]: Finished difference Result 54 states and 85 transitions.
[2018-10-26 21:58:07,538 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:07,538 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-10-26 21:58:07,538 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:07,540 INFO  L225             Difference]: With dead ends: 54
[2018-10-26 21:58:07,540 INFO  L226             Difference]: Without dead ends: 37
[2018-10-26 21:58:07,543 INFO  L605         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-10-26 21:58:07,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2018-10-26 21:58:07,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36.
[2018-10-26 21:58:07,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-10-26 21:58:07,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions.
[2018-10-26 21:58:07,550 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23
[2018-10-26 21:58:07,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:07,551 INFO  L481      AbstractCegarLoop]: Abstraction has 36 states and 47 transitions.
[2018-10-26 21:58:07,551 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:07,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2018-10-26 21:58:07,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:07,551 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:07,552 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:07,552 INFO  L424      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:07,552 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:07,552 INFO  L82        PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times
[2018-10-26 21:58:07,552 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:07,553 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:07,553 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:07,553 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:07,553 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:07,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:08,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:08,004 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-26 21:58:08,004 INFO  L194   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2018-10-26 21:58:08,005 INFO  L200      CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: 
[2018-10-26 21:58:08,007 INFO  L202      CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95]
[2018-10-26 21:58:08,056 INFO  L148    AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain]
[2018-10-26 21:58:08,056 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2)
[2018-10-26 21:58:08,164 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2018-10-26 21:58:08,939 INFO  L263    AbstractInterpreter]: Some error location(s) were reachable
[2018-10-26 21:58:08,940 INFO  L272    AbstractInterpreter]: Visited 22 different actions 150 times. Merged at 13 different actions 102 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 4 variables.
[2018-10-26 21:58:09,000 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:09,001 INFO  L422   seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2018-10-26 21:58:09,002 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-26 21:58:09,002 INFO  L194   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/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-10-26 21:58:09,015 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:09,015 INFO  L288   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-10-26 21:58:09,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:09,059 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-10-26 21:58:09,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:09,167 INFO  L316         TraceCheckSpWp]: Computing backward predicates...
[2018-10-26 21:58:12,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:12,054 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2018-10-26 21:58:12,054 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24
[2018-10-26 21:58:12,054 INFO  L251   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2018-10-26 21:58:12,054 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-10-26 21:58:12,055 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-10-26 21:58:12,055 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552
[2018-10-26 21:58:12,055 INFO  L87              Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states.
[2018-10-26 21:58:12,307 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:12,307 INFO  L93              Difference]: Finished difference Result 54 states and 66 transitions.
[2018-10-26 21:58:12,309 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-10-26 21:58:12,309 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 23
[2018-10-26 21:58:12,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:12,310 INFO  L225             Difference]: With dead ends: 54
[2018-10-26 21:58:12,310 INFO  L226             Difference]: Without dead ends: 49
[2018-10-26 21:58:12,311 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552
[2018-10-26 21:58:12,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-10-26 21:58:12,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48.
[2018-10-26 21:58:12,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-10-26 21:58:12,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions.
[2018-10-26 21:58:12,318 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23
[2018-10-26 21:58:12,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:12,318 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 60 transitions.
[2018-10-26 21:58:12,318 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-10-26 21:58:12,318 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2018-10-26 21:58:12,319 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:12,319 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:12,319 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:12,320 INFO  L424      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:12,320 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:12,320 INFO  L82        PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times
[2018-10-26 21:58:12,320 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:12,321 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:12,321 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:12,321 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:12,321 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:12,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:14,352 WARN  L832   $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false
[2018-10-26 21:58:14,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:14,355 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:14,356 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:14,356 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:14,356 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:14,356 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:14,356 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:14,357 INFO  L87              Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states.
[2018-10-26 21:58:14,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:14,362 INFO  L93              Difference]: Finished difference Result 65 states and 77 transitions.
[2018-10-26 21:58:14,362 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:14,362 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-10-26 21:58:14,362 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:14,363 INFO  L225             Difference]: With dead ends: 65
[2018-10-26 21:58:14,363 INFO  L226             Difference]: Without dead ends: 48
[2018-10-26 21:58:14,363 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:14,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-10-26 21:58:14,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-10-26 21:58:14,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-10-26 21:58:14,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions.
[2018-10-26 21:58:14,370 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23
[2018-10-26 21:58:14,370 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:14,370 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 59 transitions.
[2018-10-26 21:58:14,370 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:14,371 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions.
[2018-10-26 21:58:14,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:14,372 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:14,372 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:14,372 INFO  L424      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:14,373 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:14,373 INFO  L82        PathProgramCache]: Analyzing trace with hash -299837096, now seen corresponding path program 1 times
[2018-10-26 21:58:14,373 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:14,373 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:14,373 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:14,374 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:14,374 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:14,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:16,461 WARN  L832   $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false
[2018-10-26 21:58:16,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:16,465 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:16,465 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:16,465 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:16,466 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:16,466 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:16,466 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:16,466 INFO  L87              Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 3 states.
[2018-10-26 21:58:16,471 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:16,471 INFO  L93              Difference]: Finished difference Result 65 states and 76 transitions.
[2018-10-26 21:58:16,471 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:16,471 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-10-26 21:58:16,471 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:16,472 INFO  L225             Difference]: With dead ends: 65
[2018-10-26 21:58:16,472 INFO  L226             Difference]: Without dead ends: 48
[2018-10-26 21:58:16,472 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:16,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-10-26 21:58:16,477 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-10-26 21:58:16,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-10-26 21:58:16,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions.
[2018-10-26 21:58:16,478 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23
[2018-10-26 21:58:16,479 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:16,479 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 58 transitions.
[2018-10-26 21:58:16,479 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:16,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions.
[2018-10-26 21:58:16,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:16,481 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:16,481 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:16,481 INFO  L424      AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:16,482 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:16,482 INFO  L82        PathProgramCache]: Analyzing trace with hash -1310954346, now seen corresponding path program 1 times
[2018-10-26 21:58:16,482 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:16,483 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:16,483 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:16,483 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:16,483 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:16,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:18,534 WARN  L832   $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false
[2018-10-26 21:58:18,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:18,537 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:18,538 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:18,538 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:18,538 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:18,538 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:18,538 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:18,539 INFO  L87              Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states.
[2018-10-26 21:58:18,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:18,542 INFO  L93              Difference]: Finished difference Result 65 states and 75 transitions.
[2018-10-26 21:58:18,542 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:18,542 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-10-26 21:58:18,542 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:18,543 INFO  L225             Difference]: With dead ends: 65
[2018-10-26 21:58:18,543 INFO  L226             Difference]: Without dead ends: 48
[2018-10-26 21:58:18,543 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-10-26 21:58:18,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-10-26 21:58:18,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-10-26 21:58:18,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-10-26 21:58:18,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions.
[2018-10-26 21:58:18,549 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23
[2018-10-26 21:58:18,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:18,550 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 57 transitions.
[2018-10-26 21:58:18,550 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:18,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions.
[2018-10-26 21:58:18,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:18,550 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:18,550 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:18,551 INFO  L424      AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:18,551 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:18,551 INFO  L82        PathProgramCache]: Analyzing trace with hash -1897760360, now seen corresponding path program 1 times
[2018-10-26 21:58:18,551 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:18,551 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:18,552 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:18,552 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:18,552 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:18,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 21:58:18,758 WARN  L179               SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13
[2018-10-26 21:58:18,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 21:58:18,760 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 21:58:18,760 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 21:58:18,760 INFO  L258   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-10-26 21:58:18,760 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 21:58:18,760 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 21:58:18,761 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 21:58:18,761 INFO  L87              Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states.
[2018-10-26 21:58:18,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 21:58:18,813 INFO  L93              Difference]: Finished difference Result 66 states and 75 transitions.
[2018-10-26 21:58:18,814 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 21:58:18,815 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-10-26 21:58:18,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 21:58:18,815 INFO  L225             Difference]: With dead ends: 66
[2018-10-26 21:58:18,815 INFO  L226             Difference]: Without dead ends: 49
[2018-10-26 21:58:18,816 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 21:58:18,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-10-26 21:58:18,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48.
[2018-10-26 21:58:18,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-10-26 21:58:18,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2018-10-26 21:58:18,819 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23
[2018-10-26 21:58:18,819 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 21:58:18,820 INFO  L481      AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2018-10-26 21:58:18,821 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 21:58:18,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2018-10-26 21:58:18,822 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-10-26 21:58:18,822 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 21:58:18,822 INFO  L375         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 21:58:18,822 INFO  L424      AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 21:58:18,822 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 21:58:18,822 INFO  L82        PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times
[2018-10-26 21:58:18,822 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2018-10-26 21:58:18,823 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:18,823 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 21:58:18,823 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 21:58:18,823 INFO  L288   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-10-26 21:58:18,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 21:58:18,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 21:58:18,906 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-10-26 21:58:18,927 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:58:18 BoogieIcfgContainer
[2018-10-26 21:58:18,928 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-26 21:58:18,931 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-10-26 21:58:18,931 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-10-26 21:58:18,931 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-10-26 21:58:18,931 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:58:06" (3/4) ...
[2018-10-26 21:58:18,933 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-10-26 21:58:18,996 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_81c64992-1026-4f11-b144-c412192be754/bin-2019/utaipan/witness.graphml
[2018-10-26 21:58:18,996 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-10-26 21:58:18,997 INFO  L168              Benchmark]: Toolchain (without parser) took 13311.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 955.8 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). There was no memory consumed. Max. memory is 11.5 GB.
[2018-10-26 21:58:18,998 INFO  L168              Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-10-26 21:58:18,998 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 195.32 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-10-26 21:58:18,999 INFO  L168              Benchmark]: Boogie Procedure Inliner took 19.63 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-10-26 21:58:18,999 INFO  L168              Benchmark]: Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-10-26 21:58:19,000 INFO  L168              Benchmark]: RCFGBuilder took 586.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB.
[2018-10-26 21:58:19,008 INFO  L168              Benchmark]: TraceAbstraction took 12418.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). There was no memory consumed. Max. memory is 11.5 GB.
[2018-10-26 21:58:19,009 INFO  L168              Benchmark]: Witness Printer took 65.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB.
[2018-10-26 21:58:19,011 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 195.32 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 945.1 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 19.63 ms. Allocated memory is still 1.0 GB. Free memory is still 945.1 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 586.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 12418.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). There was no memory consumed. Max. memory is 11.5 GB.
 * Witness Printer took 65.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L10]              unsigned int x = 0;
[L11]              unsigned int y = __VERIFIER_nondet_uint();
[L12]  COND TRUE   x < 99
       VAL         [x=0, y=3]
[L13]  COND FALSE  !(y % 2 == 0)
[L14]              x += 2
       VAL         [x=2, y=3]
[L15]  COND FALSE  !(y % 2 == 0)
[L16]              x -= 2
       VAL         [x=0, y=3]
[L17]  COND FALSE  !(y % 2 == 0)
[L18]              x += 2
       VAL         [x=2, y=3]
[L19]  COND FALSE  !(y % 2 == 0)
[L20]              x -= 2
       VAL         [x=0, y=3]
[L21]  COND FALSE  !(y % 2 == 0)
[L22]              x += 2
       VAL         [x=2, y=3]
[L23]  COND FALSE  !(y % 2 == 0)
[L24]              x -= 4
       VAL         [x=4294967294, y=3]
[L25]  COND FALSE  !(y % 2 == 0)
[L26]              x += 4
       VAL         [x=2, y=3]
[L27]  COND FALSE  !(y % 2 == 0)
[L28]              x += 2
       VAL         [x=4, y=3]
[L29]  COND FALSE  !(y % 2 == 0)
[L30]              x -= 4
       VAL         [x=0, y=3]
[L31]  COND FALSE  !(y % 2 == 0)
[L32]              x -= 4
       VAL         [x=4294967292, y=3]
[L12]  COND FALSE  !(x < 99)
       VAL         [x=4294967292, y=3]
[L34]  CALL        __VERIFIER_assert((x % 2) == (y % 2))
       VAL         [\old(cond)=0]
[L4]   COND TRUE   !(cond)
       VAL         [\old(cond)=0, cond=0]
[L5]               __VERIFIER_error()
       VAL         [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 28 locations, 1 error locations. UNSAFE Result, 12.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 20 SDslu, 172 SDs, 0 SdLazy, 352 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 22213 SizeOfPredicates, 1 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...