./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/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 0c292d0c9d9c055df9398b3303a92d6621b60758 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-aa41828 [2018-11-22 22:51:02,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:51:02,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:51:02,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:51:02,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:51:02,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:51:02,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:51:02,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:51:02,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:51:02,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:51:02,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:51:02,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:51:02,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:51:02,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:51:02,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:51:02,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:51:02,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:51:02,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:51:02,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:51:02,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:51:02,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:51:02,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:51:02,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:51:02,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:51:02,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:51:02,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:51:02,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:51:02,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:51:02,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:51:02,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:51:02,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:51:02,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:51:02,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:51:02,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:51:02,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:51:02,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:51:02,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:51:02,494 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:51:02,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:51:02,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:51:02,495 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:51:02,495 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:51:02,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:51:02,496 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:51:02,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:51:02,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:51:02,496 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:51:02,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:51:02,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:51:02,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:51:02,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:51:02,499 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:51:02,499 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_34957cac-6db9-43fa-9d0f-21f46efeb275/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 -> 0c292d0c9d9c055df9398b3303a92d6621b60758 [2018-11-22 22:51:02,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:51:02,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:51:02,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:51:02,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:51:02,536 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:51:02,536 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:51:02,572 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/data/13f0af980/1cc750f20d1c4ad386e07278c133df5f/FLAG032ef67c6 [2018-11-22 22:51:02,971 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:51:02,971 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:51:02,976 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/data/13f0af980/1cc750f20d1c4ad386e07278c133df5f/FLAG032ef67c6 [2018-11-22 22:51:02,986 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/data/13f0af980/1cc750f20d1c4ad386e07278c133df5f [2018-11-22 22:51:02,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:51:02,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:51:02,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:51:02,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:51:02,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:51:02,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:51:02" (1/1) ... [2018-11-22 22:51:02,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c486bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:02, skipping insertion in model container [2018-11-22 22:51:02,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:51:02" (1/1) ... [2018-11-22 22:51:03,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:51:03,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:51:03,117 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:51:03,119 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:51:03,127 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:51:03,135 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:51:03,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03 WrapperNode [2018-11-22 22:51:03,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:51:03,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:51:03,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:51:03,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:51:03,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:51:03,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:51:03,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:51:03,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:51:03,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... [2018-11-22 22:51:03,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:51:03,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:51:03,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:51:03,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:51:03,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:51:03,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:51:03,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:51:03,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:51:03,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:51:03,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:51:03,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:51:03,227 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-22 22:51:03,227 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-22 22:51:03,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:51:03,310 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 22:51:03,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:51:03 BoogieIcfgContainer [2018-11-22 22:51:03,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:51:03,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:51:03,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:51:03,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:51:03,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:51:02" (1/3) ... [2018-11-22 22:51:03,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a7a82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:51:03, skipping insertion in model container [2018-11-22 22:51:03,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:51:03" (2/3) ... [2018-11-22 22:51:03,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a7a82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:51:03, skipping insertion in model container [2018-11-22 22:51:03,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:51:03" (3/3) ... [2018-11-22 22:51:03,316 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:51:03,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:51:03,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:51:03,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:51:03,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:51:03,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:51:03,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:51:03,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:51:03,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:51:03,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:51:03,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:51:03,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:51:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-22 22:51:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:51:03,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:03,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:03,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:03,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-22 22:51:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:03,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:03,544 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-22 22:51:03,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:51:03,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:51:03,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:51:03,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:51:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:51:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:51:03,557 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-22 22:51:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:03,583 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-22 22:51:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:51:03,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 22:51:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:03,593 INFO L225 Difference]: With dead ends: 32 [2018-11-22 22:51:03,593 INFO L226 Difference]: Without dead ends: 18 [2018-11-22 22:51:03,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:51:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-22 22:51:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 22:51:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 22:51:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-22 22:51:03,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-22 22:51:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:03,623 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-22 22:51:03,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:51:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-22 22:51:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 22:51:03,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:03,624 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:03,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:03,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-22 22:51:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:03,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:03,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:51:03,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:03,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:03,750 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-22 22:51:03,751 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-11-22 22:51:03,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:51:03,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:51:03,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:51:03,892 INFO L272 AbstractInterpreter]: Visited 17 different actions 57 times. Merged at 5 different actions 21 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-22 22:51:03,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:03,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:51:03,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:03,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/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-11-22 22:51:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:03,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:51:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:03,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:51:03,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:51:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:04,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-22 22:51:04,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:04,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:51:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:51:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:51:04,095 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-22 22:51:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:04,140 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-22 22:51:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:51:04,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-22 22:51:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:04,141 INFO L225 Difference]: With dead ends: 25 [2018-11-22 22:51:04,141 INFO L226 Difference]: Without dead ends: 21 [2018-11-22 22:51:04,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:51:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-22 22:51:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-22 22:51:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 22:51:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-22 22:51:04,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-22 22:51:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:04,146 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-22 22:51:04,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:51:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-22 22:51:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:51:04,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:04,147 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:04,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:04,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-22 22:51:04,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:51:04,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:04,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:04,235 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:04,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:04,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:04,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:04,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:51:04,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:51:04,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:51:04,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:04,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:51:04,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:51:04,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:04,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-22 22:51:04,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:04,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:51:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:51:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:51:04,489 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-22 22:51:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:04,513 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-22 22:51:04,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:51:04,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-22 22:51:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:04,514 INFO L225 Difference]: With dead ends: 28 [2018-11-22 22:51:04,514 INFO L226 Difference]: Without dead ends: 24 [2018-11-22 22:51:04,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:51:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-22 22:51:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-22 22:51:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:51:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-22 22:51:04,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-22 22:51:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-22 22:51:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:51:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-22 22:51:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 22:51:04,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:04,519 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:04,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:04,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-22 22:51:04,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:04,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:04,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 22:51:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:04,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:04,634 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:04,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:04,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:04,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:51:04,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:51:04,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:51:04,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:04,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 22:51:04,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 22:51:04,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:04,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-22 22:51:04,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:04,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:51:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:51:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:51:04,890 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-11-22 22:51:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:04,924 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-22 22:51:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:51:04,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-22 22:51:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:04,925 INFO L225 Difference]: With dead ends: 31 [2018-11-22 22:51:04,926 INFO L226 Difference]: Without dead ends: 27 [2018-11-22 22:51:04,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:51:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-22 22:51:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-22 22:51:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 22:51:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-22 22:51:04,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-22 22:51:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:04,930 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-22 22:51:04,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:51:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-22 22:51:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 22:51:04,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:04,931 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:04,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:04,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-22 22:51:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:04,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-22 22:51:05,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:05,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:05,074 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:05,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:05,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:05,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:05,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:51:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:05,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-22 22:51:05,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-22 22:51:05,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:05,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-22 22:51:05,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:05,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 22:51:05,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 22:51:05,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-22 22:51:05,395 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-11-22 22:51:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:05,437 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-22 22:51:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 22:51:05,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-22 22:51:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:05,438 INFO L225 Difference]: With dead ends: 34 [2018-11-22 22:51:05,439 INFO L226 Difference]: Without dead ends: 30 [2018-11-22 22:51:05,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-22 22:51:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-22 22:51:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-22 22:51:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:51:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-22 22:51:05,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-22 22:51:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:05,443 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-22 22:51:05,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 22:51:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-22 22:51:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-22 22:51:05,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:05,444 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:05,444 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:05,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-22 22:51:05,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:05,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:05,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 22:51:05,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:05,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:05,572 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:05,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:05,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:05,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:05,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:51:05,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:51:05,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-22 22:51:05,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:05,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 22:51:05,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 22:51:05,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:05,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-22 22:51:05,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:05,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 22:51:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 22:51:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-11-22 22:51:05,998 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-22 22:51:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:06,055 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-22 22:51:06,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 22:51:06,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-22 22:51:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:06,056 INFO L225 Difference]: With dead ends: 37 [2018-11-22 22:51:06,056 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 22:51:06,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-11-22 22:51:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 22:51:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 22:51:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 22:51:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-22 22:51:06,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-22 22:51:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:06,060 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-22 22:51:06,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 22:51:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-22 22:51:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 22:51:06,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:06,061 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:06,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-22 22:51:06,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:06,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:06,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-22 22:51:06,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:06,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:06,238 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:06,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:06,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:06,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:06,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:51:06,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:51:06,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:51:06,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:06,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-22 22:51:06,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-22 22:51:06,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:06,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-22 22:51:06,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:06,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-22 22:51:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-22 22:51:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-11-22 22:51:06,775 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-11-22 22:51:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:06,832 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-22 22:51:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 22:51:06,832 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-22 22:51:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:06,833 INFO L225 Difference]: With dead ends: 40 [2018-11-22 22:51:06,833 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:51:06,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-11-22 22:51:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:51:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 22:51:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:51:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-22 22:51:06,838 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-22 22:51:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:06,838 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-22 22:51:06,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-22 22:51:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-22 22:51:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 22:51:06,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:06,839 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:06,839 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:06,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-22 22:51:06,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:06,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:06,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-22 22:51:06,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:06,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:06,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:06,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:06,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:06,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:06,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:51:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:07,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-22 22:51:07,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-22 22:51:07,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:07,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-22 22:51:07,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-22 22:51:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-22 22:51:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-11-22 22:51:07,606 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-11-22 22:51:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:07,693 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-22 22:51:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 22:51:07,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-22 22:51:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:07,694 INFO L225 Difference]: With dead ends: 43 [2018-11-22 22:51:07,695 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 22:51:07,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-11-22 22:51:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 22:51:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-22 22:51:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 22:51:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-22 22:51:07,699 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-22 22:51:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:07,699 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-22 22:51:07,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-22 22:51:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-22 22:51:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-22 22:51:07,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:07,700 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:07,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:07,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-22 22:51:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:51:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:07,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 22:51:07,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:07,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:07,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:07,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:07,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:07,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:07,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:51:07,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:51:07,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-22 22:51:07,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:07,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 22:51:07,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 22:51:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-22 22:51:08,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:08,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-22 22:51:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-22 22:51:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-11-22 22:51:08,648 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-11-22 22:51:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:08,729 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-22 22:51:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-22 22:51:08,729 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-11-22 22:51:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:08,730 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:51:08,730 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 22:51:08,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-11-22 22:51:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 22:51:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-22 22:51:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 22:51:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-22 22:51:08,734 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-22 22:51:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:08,734 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-22 22:51:08,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-22 22:51:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-22 22:51:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-22 22:51:08,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:08,735 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:08,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:08,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-22 22:51:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:08,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:08,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:51:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-22 22:51:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:08,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:51:08,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:51:08,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:51:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:51:08,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:51:08,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:51:08,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:51:08,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:51:08,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:51:08,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:51:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-22 22:51:09,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:51:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-22 22:51:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:51:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-22 22:51:09,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:51:09,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-22 22:51:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-22 22:51:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2018-11-22 22:51:09,831 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-11-22 22:51:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:51:09,930 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-22 22:51:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-22 22:51:09,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-22 22:51:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:51:09,931 INFO L225 Difference]: With dead ends: 49 [2018-11-22 22:51:09,932 INFO L226 Difference]: Without dead ends: 45 [2018-11-22 22:51:09,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2018-11-22 22:51:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-22 22:51:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-22 22:51:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-22 22:51:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-22 22:51:09,936 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-22 22:51:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:51:09,936 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-22 22:51:09,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-22 22:51:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-22 22:51:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 22:51:09,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:51:09,937 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:51:09,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:51:09,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:51:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-22 22:51:09,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:51:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:09,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:51:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:51:09,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:51:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:51:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:51:09,997 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967306] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #30#return; VAL [main_~input~0=4294967306, |main_#t~ret2|=10] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume 10 == ~result~0 % 4294967296; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume !false; VAL [main_~input~0=4294967306, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-22 22:51:10,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:51:10 BoogieIcfgContainer [2018-11-22 22:51:10,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:51:10,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:51:10,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:51:10,060 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:51:10,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:51:03" (3/4) ... [2018-11-22 22:51:10,063 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967306] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #30#return; VAL [main_~input~0=4294967306, |main_#t~ret2|=10] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume 10 == ~result~0 % 4294967296; VAL [main_~input~0=4294967306, main_~result~0=10] [?] assume !false; VAL [main_~input~0=4294967306, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12-L14] assume 10 == ~result~0 % 4294967296; VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967306] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=10, ~input~0=4294967306] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967306, ~result~0=10] [L12] COND TRUE 10 == ~result~0 % 4294967296 VAL [~input~0=4294967306, ~result~0=10] [L13] assert false; VAL [~input~0=4294967306, ~result~0=10] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-22 22:51:10,231 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34957cac-6db9-43fa-9d0f-21f46efeb275/bin-2019/utaipan/witness.graphml [2018-11-22 22:51:10,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:51:10,232 INFO L168 Benchmark]: Toolchain (without parser) took 7243.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -108.8 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:51:10,233 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:51:10,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:51:10,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.52 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:51:10,234 INFO L168 Benchmark]: Boogie Preprocessor took 10.02 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:51:10,234 INFO L168 Benchmark]: RCFGBuilder took 151.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:51:10,234 INFO L168 Benchmark]: TraceAbstraction took 6748.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:51:10,235 INFO L168 Benchmark]: Witness Printer took 171.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-22 22:51:10,241 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.52 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.02 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6748.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. * Witness Printer took 171.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 6.7s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 2 SDslu, 2866 SDs, 0 SdLazy, 1208 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 650 SyntacticMatches, 9 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1146 ConstructedInterpolants, 0 QuantifiedInterpolants, 210054 SizeOfPredicates, 9 NumberOfNonLiveVariables, 810 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1350/2700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...