./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 5842f4b8
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer --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 Automizer --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-5842f4b
[2018-11-18 10:31:15,166 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-18 10:31:15,167 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-18 10:31:15,174 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-18 10:31:15,174 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-18 10:31:15,175 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-18 10:31:15,175 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-18 10:31:15,176 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-18 10:31:15,177 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-18 10:31:15,178 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-18 10:31:15,178 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-18 10:31:15,179 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-18 10:31:15,179 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-18 10:31:15,180 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-18 10:31:15,181 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-18 10:31:15,182 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-18 10:31:15,182 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-18 10:31:15,183 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-18 10:31:15,185 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-18 10:31:15,186 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-18 10:31:15,186 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-18 10:31:15,187 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-18 10:31:15,189 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-18 10:31:15,189 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-18 10:31:15,189 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-18 10:31:15,190 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-18 10:31:15,191 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-18 10:31:15,191 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-18 10:31:15,192 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-18 10:31:15,192 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-18 10:31:15,192 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-18 10:31:15,193 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-18 10:31:15,193 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-18 10:31:15,193 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-18 10:31:15,194 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-18 10:31:15,194 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-18 10:31:15,194 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf
[2018-11-18 10:31:15,204 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-18 10:31:15,204 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-18 10:31:15,205 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-18 10:31:15,205 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-11-18 10:31:15,205 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-18 10:31:15,205 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-18 10:31:15,206 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-18 10:31:15,206 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-18 10:31:15,207 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-18 10:31:15,207 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-18 10:31:15,208 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-18 10:31:15,208 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-18 10:31:15,209 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-18 10:31:15,209 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-18 10:31:15,209 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-18 10:31:15,209 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
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_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer
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 -> Automizer
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-11-18 10:31:15,230 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-18 10:31:15,239 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-18 10:31:15,242 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-18 10:31:15,243 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-18 10:31:15,243 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-18 10:31:15,243 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-11-18 10:31:15,279 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/data/643d10271/f4c10e545e144d9988b98be2e1fbe7e7/FLAG9edbeeb01
[2018-11-18 10:31:15,676 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-18 10:31:15,676 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i
[2018-11-18 10:31:15,680 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/data/643d10271/f4c10e545e144d9988b98be2e1fbe7e7/FLAG9edbeeb01
[2018-11-18 10:31:15,689 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/data/643d10271/f4c10e545e144d9988b98be2e1fbe7e7
[2018-11-18 10:31:15,691 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-18 10:31:15,692 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-11-18 10:31:15,693 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-18 10:31:15,693 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-18 10:31:15,696 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-18 10:31:15,697 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,699 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88e9939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15, skipping insertion in model container
[2018-11-18 10:31:15,699 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,706 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-18 10:31:15,722 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-18 10:31:15,839 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-18 10:31:15,842 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-18 10:31:15,855 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-18 10:31:15,863 INFO  L195         MainTranslator]: Completed translation
[2018-11-18 10:31:15,864 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15 WrapperNode
[2018-11-18 10:31:15,864 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-18 10:31:15,864 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-18 10:31:15,864 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-18 10:31:15,864 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-18 10:31:15,874 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,874 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,877 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,877 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,880 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,883 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,884 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
[2018-11-18 10:31:15,885 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-18 10:31:15,885 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-18 10:31:15,885 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-18 10:31:15,885 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-18 10:31:15,886 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/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-18 10:31:15,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-18 10:31:15,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-18 10:31:15,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2018-11-18 10:31:15,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-18 10:31:15,957 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-11-18 10:31:15,957 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2018-11-18 10:31:15,957 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2018-11-18 10:31:15,957 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-18 10:31:15,957 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-18 10:31:15,958 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-18 10:31:16,112 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-18 10:31:16,112 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:16 BoogieIcfgContainer
[2018-11-18 10:31:16,112 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-18 10:31:16,113 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-18 10:31:16,113 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-18 10:31:16,115 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-18 10:31:16,115 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:31:15" (1/3) ...
[2018-11-18 10:31:16,116 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b806c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:16, skipping insertion in model container
[2018-11-18 10:31:16,116 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:15" (2/3) ...
[2018-11-18 10:31:16,116 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b806c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:16, skipping insertion in model container
[2018-11-18 10:31:16,116 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:16" (3/3) ...
[2018-11-18 10:31:16,118 INFO  L112   eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i
[2018-11-18 10:31:16,124 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-18 10:31:16,129 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-18 10:31:16,138 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-18 10:31:16,158 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-18 10:31:16,158 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-18 10:31:16,158 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-18 10:31:16,158 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-18 10:31:16,158 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-18 10:31:16,158 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-18 10:31:16,159 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-18 10:31:16,159 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-18 10:31:16,159 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-18 10:31:16,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states.
[2018-11-18 10:31:16,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-11-18 10:31:16,175 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:16,175 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-18 10:31:16,177 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:16,180 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:16,180 INFO  L82        PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times
[2018-11-18 10:31:16,182 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:16,182 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:16,218 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,218 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:16,218 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:16,254 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-18 10:31:16,255 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:16,256 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-11-18 10:31:16,258 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-11-18 10:31:16,266 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-11-18 10:31:16,267 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-11-18 10:31:16,268 INFO  L87              Difference]: Start difference. First operand 28 states. Second operand 2 states.
[2018-11-18 10:31:16,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:16,282 INFO  L93              Difference]: Finished difference Result 39 states and 52 transitions.
[2018-11-18 10:31:16,282 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-11-18 10:31:16,283 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2018-11-18 10:31:16,283 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:16,288 INFO  L225             Difference]: With dead ends: 39
[2018-11-18 10:31:16,288 INFO  L226             Difference]: Without dead ends: 22
[2018-11-18 10:31:16,290 INFO  L604         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-11-18 10:31:16,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-11-18 10:31:16,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2018-11-18 10:31:16,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2018-11-18 10:31:16,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions.
[2018-11-18 10:31:16,314 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10
[2018-11-18 10:31:16,315 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:16,315 INFO  L480      AbstractCegarLoop]: Abstraction has 22 states and 32 transitions.
[2018-11-18 10:31:16,315 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-11-18 10:31:16,315 INFO  L276                IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions.
[2018-11-18 10:31:16,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-11-18 10:31:16,315 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:16,315 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-18 10:31:16,316 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:16,316 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:16,316 INFO  L82        PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times
[2018-11-18 10:31:16,316 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:16,316 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:16,317 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,317 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:16,317 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:16,399 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-18 10:31:16,400 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:16,400 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:16,401 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:16,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:16,401 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-18 10:31:16,405 INFO  L87              Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states.
[2018-11-18 10:31:16,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:16,461 INFO  L93              Difference]: Finished difference Result 30 states and 41 transitions.
[2018-11-18 10:31:16,461 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:16,462 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2018-11-18 10:31:16,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:16,463 INFO  L225             Difference]: With dead ends: 30
[2018-11-18 10:31:16,463 INFO  L226             Difference]: Without dead ends: 25
[2018-11-18 10:31:16,464 INFO  L604         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-11-18 10:31:16,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2018-11-18 10:31:16,468 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24.
[2018-11-18 10:31:16,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2018-11-18 10:31:16,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions.
[2018-11-18 10:31:16,469 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11
[2018-11-18 10:31:16,469 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:16,469 INFO  L480      AbstractCegarLoop]: Abstraction has 24 states and 34 transitions.
[2018-11-18 10:31:16,470 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:16,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions.
[2018-11-18 10:31:16,470 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:16,470 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:16,470 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-11-18 10:31:16,471 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:16,471 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:16,471 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times
[2018-11-18 10:31:16,471 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:16,471 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:16,472 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,472 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:16,473 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:16,563 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-18 10:31:16,563 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:16,563 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:16,563 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:16,564 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:16,564 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-18 10:31:16,564 INFO  L87              Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states.
[2018-11-18 10:31:16,659 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:16,659 INFO  L93              Difference]: Finished difference Result 54 states and 85 transitions.
[2018-11-18 10:31:16,659 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:16,659 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-18 10:31:16,660 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:16,661 INFO  L225             Difference]: With dead ends: 54
[2018-11-18 10:31:16,661 INFO  L226             Difference]: Without dead ends: 37
[2018-11-18 10:31:16,661 INFO  L604         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-11-18 10:31:16,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2018-11-18 10:31:16,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36.
[2018-11-18 10:31:16,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-11-18 10:31:16,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions.
[2018-11-18 10:31:16,667 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23
[2018-11-18 10:31:16,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:16,667 INFO  L480      AbstractCegarLoop]: Abstraction has 36 states and 47 transitions.
[2018-11-18 10:31:16,667 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:16,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2018-11-18 10:31:16,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:16,667 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:16,668 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-11-18 10:31:16,668 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:16,668 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:16,668 INFO  L82        PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times
[2018-11-18 10:31:16,668 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:16,668 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:16,669 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,669 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:16,669 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:16,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:16,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-18 10:31:16,867 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-11-18 10:31:16,867 INFO  L223   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/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-11-18 10:31:16,882 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:16,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:16,910 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-18 10:31:16,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-18 10:31:16,988 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-11-18 10:31:16,989 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14
[2018-11-18 10:31:16,989 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-11-18 10:31:16,989 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-11-18 10:31:16,989 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2018-11-18 10:31:16,990 INFO  L87              Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 14 states.
[2018-11-18 10:31:17,242 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:17,242 INFO  L93              Difference]: Finished difference Result 55 states and 68 transitions.
[2018-11-18 10:31:17,243 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-11-18 10:31:17,243 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 23
[2018-11-18 10:31:17,243 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:17,244 INFO  L225             Difference]: With dead ends: 55
[2018-11-18 10:31:17,244 INFO  L226             Difference]: Without dead ends: 50
[2018-11-18 10:31:17,244 INFO  L604         BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2018-11-18 10:31:17,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-11-18 10:31:17,248 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48.
[2018-11-18 10:31:17,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-18 10:31:17,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions.
[2018-11-18 10:31:17,250 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23
[2018-11-18 10:31:17,250 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:17,250 INFO  L480      AbstractCegarLoop]: Abstraction has 48 states and 60 transitions.
[2018-11-18 10:31:17,250 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-11-18 10:31:17,250 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions.
[2018-11-18 10:31:17,251 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:17,251 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:17,251 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-11-18 10:31:17,251 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:17,251 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:17,251 INFO  L82        PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times
[2018-11-18 10:31:17,251 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:17,252 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:17,252 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:17,252 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:17,253 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:17,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:19,286 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-11-18 10:31:19,289 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-18 10:31:19,289 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:19,289 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:19,290 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:19,290 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:19,290 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-18 10:31:19,290 INFO  L87              Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states.
[2018-11-18 10:31:19,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:19,294 INFO  L93              Difference]: Finished difference Result 65 states and 77 transitions.
[2018-11-18 10:31:19,294 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:19,294 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-18 10:31:19,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:19,295 INFO  L225             Difference]: With dead ends: 65
[2018-11-18 10:31:19,295 INFO  L226             Difference]: Without dead ends: 48
[2018-11-18 10:31:19,296 INFO  L604         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-11-18 10:31:19,296 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-18 10:31:19,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-18 10:31:19,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-18 10:31:19,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions.
[2018-11-18 10:31:19,300 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23
[2018-11-18 10:31:19,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:19,301 INFO  L480      AbstractCegarLoop]: Abstraction has 48 states and 59 transitions.
[2018-11-18 10:31:19,301 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:19,301 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions.
[2018-11-18 10:31:19,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:19,301 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:19,302 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-11-18 10:31:19,302 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:19,302 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:19,302 INFO  L82        PathProgramCache]: Analyzing trace with hash -299837096, now seen corresponding path program 1 times
[2018-11-18 10:31:19,302 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:19,303 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:19,303 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:19,304 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:19,304 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:19,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:21,336 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-11-18 10:31:21,340 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-18 10:31:21,340 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:21,340 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:21,341 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:21,341 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:21,341 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-18 10:31:21,341 INFO  L87              Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 3 states.
[2018-11-18 10:31:21,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:21,344 INFO  L93              Difference]: Finished difference Result 65 states and 76 transitions.
[2018-11-18 10:31:21,344 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:21,344 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-18 10:31:21,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:21,345 INFO  L225             Difference]: With dead ends: 65
[2018-11-18 10:31:21,345 INFO  L226             Difference]: Without dead ends: 48
[2018-11-18 10:31:21,346 INFO  L604         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-11-18 10:31:21,346 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-18 10:31:21,349 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-18 10:31:21,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-18 10:31:21,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions.
[2018-11-18 10:31:21,350 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 23
[2018-11-18 10:31:21,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:21,351 INFO  L480      AbstractCegarLoop]: Abstraction has 48 states and 58 transitions.
[2018-11-18 10:31:21,351 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:21,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions.
[2018-11-18 10:31:21,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:21,352 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:21,352 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-11-18 10:31:21,352 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:21,352 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:21,352 INFO  L82        PathProgramCache]: Analyzing trace with hash -1310954346, now seen corresponding path program 1 times
[2018-11-18 10:31:21,353 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:21,353 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:21,353 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:21,354 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:21,354 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:21,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:23,388 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-11-18 10:31:23,392 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-18 10:31:23,393 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:23,393 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:23,393 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:23,393 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:23,393 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6
[2018-11-18 10:31:23,394 INFO  L87              Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states.
[2018-11-18 10:31:23,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:23,396 INFO  L93              Difference]: Finished difference Result 65 states and 75 transitions.
[2018-11-18 10:31:23,396 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:23,396 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-18 10:31:23,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:23,396 INFO  L225             Difference]: With dead ends: 65
[2018-11-18 10:31:23,396 INFO  L226             Difference]: Without dead ends: 48
[2018-11-18 10:31:23,397 INFO  L604         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-11-18 10:31:23,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-11-18 10:31:23,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-11-18 10:31:23,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-18 10:31:23,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions.
[2018-11-18 10:31:23,400 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23
[2018-11-18 10:31:23,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:23,400 INFO  L480      AbstractCegarLoop]: Abstraction has 48 states and 57 transitions.
[2018-11-18 10:31:23,400 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:23,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions.
[2018-11-18 10:31:23,401 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:23,401 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:23,401 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-11-18 10:31:23,401 INFO  L423      AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:23,401 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:23,402 INFO  L82        PathProgramCache]: Analyzing trace with hash -1897760360, now seen corresponding path program 1 times
[2018-11-18 10:31:23,402 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:23,402 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:23,402 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:23,403 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:23,403 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:23,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-18 10:31:23,433 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-18 10:31:23,433 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-18 10:31:23,433 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-18 10:31:23,433 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-11-18 10:31:23,433 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-18 10:31:23,434 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-18 10:31:23,434 INFO  L87              Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 3 states.
[2018-11-18 10:31:23,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-18 10:31:23,490 INFO  L93              Difference]: Finished difference Result 66 states and 75 transitions.
[2018-11-18 10:31:23,490 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-18 10:31:23,490 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-11-18 10:31:23,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-18 10:31:23,491 INFO  L225             Difference]: With dead ends: 66
[2018-11-18 10:31:23,491 INFO  L226             Difference]: Without dead ends: 49
[2018-11-18 10:31:23,492 INFO  L604         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-11-18 10:31:23,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-11-18 10:31:23,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48.
[2018-11-18 10:31:23,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-11-18 10:31:23,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2018-11-18 10:31:23,495 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23
[2018-11-18 10:31:23,495 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-18 10:31:23,495 INFO  L480      AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2018-11-18 10:31:23,495 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-11-18 10:31:23,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2018-11-18 10:31:23,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-11-18 10:31:23,496 INFO  L367         BasicCegarLoop]: Found error trace
[2018-11-18 10:31:23,496 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-11-18 10:31:23,496 INFO  L423      AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-18 10:31:23,497 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-18 10:31:23,497 INFO  L82        PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times
[2018-11-18 10:31:23,497 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-18 10:31:23,497 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-18 10:31:23,497 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:23,498 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-18 10:31:23,498 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-18 10:31:23,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-18 10:31:23,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-18 10:31:23,535 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-11-18 10:31:23,551 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:31:23 BoogieIcfgContainer
[2018-11-18 10:31:23,551 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-18 10:31:23,551 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-18 10:31:23,551 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-18 10:31:23,551 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-18 10:31:23,552 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:16" (3/4) ...
[2018-11-18 10:31:23,553 INFO  L138         WitnessPrinter]: Generating witness for reachability counterexample
[2018-11-18 10:31:23,587 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_507d5f9c-3e0a-4383-96af-7be702f24ce0/bin-2019/uautomizer/witness.graphml
[2018-11-18 10:31:23,588 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-18 10:31:23,588 INFO  L168              Benchmark]: Toolchain (without parser) took 7896.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 958.1 MB in the beginning and 979.2 MB in the end (delta: -21.1 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,589 INFO  L168              Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,590 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 170.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,590 INFO  L168              Benchmark]: Boogie Preprocessor took 20.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,590 INFO  L168              Benchmark]: RCFGBuilder took 227.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,591 INFO  L168              Benchmark]: TraceAbstraction took 7438.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 161.3 MB). Peak memory consumption was 161.3 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,591 INFO  L168              Benchmark]: Witness Printer took 36.69 ms. Allocated memory is still 1.2 GB. Free memory was 982.4 MB in the beginning and 979.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB.
[2018-11-18 10:31:23,595 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 170.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 20.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 227.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 7438.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 161.3 MB). Peak memory consumption was 161.3 MB. Max. memory is 11.5 GB.
 * Witness Printer took 36.69 ms. Allocated memory is still 1.2 GB. Free memory was 982.4 MB in the beginning and 979.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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, 7.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 22 SDslu, 157 SDs, 0 SdLazy, 341 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.3s 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.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 20145 SizeOfPredicates, 1 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...