./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.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_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/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 f3d619d2c1c3b5319c1ba41a41e084c9947cb440 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 12:57:43,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:57:43,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:57:43,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:57:43,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:57:43,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:57:43,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:57:43,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:57:43,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:57:43,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:57:43,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:57:43,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:57:43,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:57:43,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:57:43,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:57:43,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:57:43,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:57:43,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:57:43,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:57:43,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:57:43,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:57:43,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:57:43,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:57:43,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:57:43,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:57:43,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:57:43,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:57:43,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:57:43,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:57:43,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:57:43,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:57:43,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:57:43,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:57:43,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:57:43,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:57:43,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:57:43,365 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:57:43,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:57:43,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:57:43,373 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:57:43,373 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:57:43,373 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:57:43,373 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:57:43,374 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:57:43,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:57:43,375 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:57:43,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:57:43,375 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:57:43,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:57:43,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:57:43,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:57:43,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:57:43,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:57:43,378 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:57:43,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:57:43,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:57:43,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:57:43,378 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/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 -> f3d619d2c1c3b5319c1ba41a41e084c9947cb440 [2018-11-23 12:57:43,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:57:43,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:57:43,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:57:43,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:57:43,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:57:43,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 12:57:43,453 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/data/eeb614106/13c9a34a65404db989af4e7a18f33a23/FLAG7a1bdb5ad [2018-11-23 12:57:43,753 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:57:43,753 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 12:57:43,758 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/data/eeb614106/13c9a34a65404db989af4e7a18f33a23/FLAG7a1bdb5ad [2018-11-23 12:57:43,766 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/data/eeb614106/13c9a34a65404db989af4e7a18f33a23 [2018-11-23 12:57:43,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:57:43,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:57:43,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:43,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:57:43,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:57:43,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f375ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43, skipping insertion in model container [2018-11-23 12:57:43,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:57:43,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:57:43,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:43,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:57:43,923 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:43,931 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:57:43,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43 WrapperNode [2018-11-23 12:57:43,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:43,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:43,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:57:43,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:57:43,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:43,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:57:43,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:57:43,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:57:43,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... [2018-11-23 12:57:43,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:57:43,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:57:43,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:57:43,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:57:43,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/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-23 12:57:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:57:44,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:57:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-11-23 12:57:44,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-11-23 12:57:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-11-23 12:57:44,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-11-23 12:57:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:57:44,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:57:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:57:44,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:57:44,131 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:57:44,131 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:57:44,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:44 BoogieIcfgContainer [2018-11-23 12:57:44,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:57:44,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:57:44,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:57:44,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:57:44,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:57:43" (1/3) ... [2018-11-23 12:57:44,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:44, skipping insertion in model container [2018-11-23 12:57:44,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:43" (2/3) ... [2018-11-23 12:57:44,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:44, skipping insertion in model container [2018-11-23 12:57:44,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:44" (3/3) ... [2018-11-23 12:57:44,136 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 12:57:44,143 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:57:44,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:57:44,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:57:44,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:57:44,184 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:57:44,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:57:44,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:57:44,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:57:44,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:57:44,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:57:44,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:57:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:57:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:57:44,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:44,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:44,203 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash -241846627, now seen corresponding path program 1 times [2018-11-23 12:57:44,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:57:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:44,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:44,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:57:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:57:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:57:44,289 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #48#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=0] [?] assume !(~n~0 < 0); VAL [main_~n~0=0] [?] CALL call #t~ret3 := isEven(~n~0); VAL [|isEven_#in~n|=0] [?] ~n := #in~n; VAL [isEven_~n=0, |isEven_#in~n|=0] [?] assume 0 == ~n;#res := 1; VAL [isEven_~n=0, |isEven_#in~n|=0, |isEven_#res|=1] [?] assume true; VAL [isEven_~n=0, |isEven_#in~n|=0, |isEven_#res|=1] [?] RET #52#return; VAL [main_~n~0=0, |main_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3;~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] assume !false; VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39-L41] assume !(~n~0 < 0); VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27-L33] assume 0 == ~n; [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L14] ensures true; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44-L48] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39-L41] assume !(~n~0 < 0); VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27-L33] assume 0 == ~n; [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L14] ensures true; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44-L48] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L38] int n = __VERIFIER_nondet_int(); [L39] COND FALSE !(n < 0) VAL [n=0] [L42] CALL, EXPR isEven(n) VAL [\old(n)=0] [L27] COND TRUE n == 0 [L28] return 1; VAL [\old(n)=0, \result=1, n=0] [L42] RET, EXPR isEven(n) VAL [isEven(n)=1, n=0] [L42] int result = isEven(n); [L43] int mod = n % 2; VAL [mod=0, n=0, result=1] [L44] COND FALSE !(result < 0 || result == mod) VAL [mod=0, n=0, result=1] [L47] __VERIFIER_error() VAL [mod=0, n=0, result=1] ----- [2018-11-23 12:57:44,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:57:44 BoogieIcfgContainer [2018-11-23 12:57:44,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:57:44,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:57:44,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:57:44,312 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:57:44,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:44" (3/4) ... [2018-11-23 12:57:44,314 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 #48#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=0] [?] assume !(~n~0 < 0); VAL [main_~n~0=0] [?] CALL call #t~ret3 := isEven(~n~0); VAL [|isEven_#in~n|=0] [?] ~n := #in~n; VAL [isEven_~n=0, |isEven_#in~n|=0] [?] assume 0 == ~n;#res := 1; VAL [isEven_~n=0, |isEven_#in~n|=0, |isEven_#res|=1] [?] assume true; VAL [isEven_~n=0, |isEven_#in~n|=0, |isEven_#res|=1] [?] RET #52#return; VAL [main_~n~0=0, |main_#t~ret3|=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3;~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] assume !false; VAL [main_~mod~0=0, main_~n~0=0, main_~result~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39-L41] assume !(~n~0 < 0); VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27-L33] assume 0 == ~n; [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L14] ensures true; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44-L48] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39-L41] assume !(~n~0 < 0); VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27-L33] assume 0 == ~n; [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L14] ensures true; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44-L48] assume !(~result~0 < 0 || ~result~0 == ~mod~0); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=0] [L39] COND FALSE !(~n~0 < 0) VAL [~n~0=0] [L42] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=0] [L26-L34] ~n := #in~n; VAL [#in~n=0, ~n=0] [L27] COND TRUE 0 == ~n [L28] #res := 1; VAL [#in~n=0, #res=1, ~n=0] [L42] RET call #t~ret3 := isEven(~n~0); VAL [#t~ret3=1, ~n~0=0] [L42] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L42] ~result~0 := #t~ret3; [L42] havoc #t~ret3; [L43] ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L44] COND FALSE !(~result~0 < 0 || ~result~0 == ~mod~0) VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L47] assert false; VAL [~mod~0=0, ~n~0=0, ~result~0=1] [L38] int n = __VERIFIER_nondet_int(); [L39] COND FALSE !(n < 0) VAL [n=0] [L42] CALL, EXPR isEven(n) VAL [\old(n)=0] [L27] COND TRUE n == 0 [L28] return 1; VAL [\old(n)=0, \result=1, n=0] [L42] RET, EXPR isEven(n) VAL [isEven(n)=1, n=0] [L42] int result = isEven(n); [L43] int mod = n % 2; VAL [mod=0, n=0, result=1] [L44] COND FALSE !(result < 0 || result == mod) VAL [mod=0, n=0, result=1] [L47] __VERIFIER_error() VAL [mod=0, n=0, result=1] ----- [2018-11-23 12:57:44,347 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a3019bf-ce14-4c0f-b643-ad5e0f99e7f9/bin-2019/utaipan/witness.graphml [2018-11-23 12:57:44,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:57:44,347 INFO L168 Benchmark]: Toolchain (without parser) took 579.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 274.5 kB. Max. memory is 11.5 GB. [2018-11-23 12:57:44,349 INFO L168 Benchmark]: CDTParser took 0.16 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-23 12:57:44,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.20 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-23 12:57:44,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.25 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-23 12:57:44,350 INFO L168 Benchmark]: Boogie Preprocessor took 10.27 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:57:44,350 INFO L168 Benchmark]: RCFGBuilder took 178.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:57:44,351 INFO L168 Benchmark]: TraceAbstraction took 179.27 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:57:44,351 INFO L168 Benchmark]: Witness Printer took 35.10 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:57:44,353 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.16 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 162.20 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.25 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. * Boogie Preprocessor took 10.27 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 178.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179.27 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 35.10 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 47]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int n = __VERIFIER_nondet_int(); [L39] COND FALSE !(n < 0) VAL [n=0] [L42] CALL, EXPR isEven(n) VAL [\old(n)=0] [L27] COND TRUE n == 0 [L28] return 1; VAL [\old(n)=0, \result=1, n=0] [L42] RET, EXPR isEven(n) VAL [isEven(n)=1, n=0] [L42] int result = isEven(n); [L43] int mod = n % 2; VAL [mod=0, n=0, result=1] [L44] COND FALSE !(result < 0 || result == mod) VAL [mod=0, n=0, result=1] [L47] __VERIFIER_error() VAL [mod=0, n=0, result=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...