./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_b3_o2_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_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_b3_o2_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/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 3bf945356a28265a842df89cdbf40bfa9a223140 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:55:50,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:55:50,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:55:50,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:55:50,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:55:50,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:55:50,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:55:50,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:55:50,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:55:50,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:55:50,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:55:50,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:55:50,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:55:50,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:55:50,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:55:50,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:55:50,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:55:50,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:55:50,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:55:50,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:55:50,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:55:50,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:55:50,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:55:50,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:55:50,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:55:50,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:55:50,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:55:50,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:55:50,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:55:50,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:55:50,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:55:50,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:55:50,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:55:50,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:55:50,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:55:50,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:55:50,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:55:50,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:55:50,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:55:50,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:55:50,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:55:50,342 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:55:50,342 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:55:50,342 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:55:50,343 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:55:50,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:55:50,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:55:50,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:55:50,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:55:50,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:55:50,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:55:50,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:55:50,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:55:50,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:55:50,347 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:55:50,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:55:50,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:55:50,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:55:50,347 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_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/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 -> 3bf945356a28265a842df89cdbf40bfa9a223140 [2018-11-22 23:55:50,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:55:50,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:55:50,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:55:50,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:55:50,383 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:55:50,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 23:55:50,422 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/data/d4a62ff0e/dcaa4380779a46698152752482aa5834/FLAGa2aee9e54 [2018-11-22 23:55:50,733 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:55:50,734 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/sv-benchmarks/c/recursive-simple/id_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 23:55:50,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/data/d4a62ff0e/dcaa4380779a46698152752482aa5834/FLAGa2aee9e54 [2018-11-22 23:55:50,746 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/data/d4a62ff0e/dcaa4380779a46698152752482aa5834 [2018-11-22 23:55:50,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:55:50,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:55:50,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:55:50,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:55:50,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:55:50,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d10cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50, skipping insertion in model container [2018-11-22 23:55:50,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:55:50,772 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:55:50,878 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:55:50,881 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:55:50,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:55:50,898 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:55:50,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50 WrapperNode [2018-11-22 23:55:50,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:55:50,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:55:50,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:55:50,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:55:50,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:55:50,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:55:50,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:55:50,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:55:50,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... [2018-11-22 23:55:50,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:55:50,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:55:50,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:55:50,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:55:50,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/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 23:55:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:55:50,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:55:50,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:55:50,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:55:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:55:50,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:55:50,993 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-22 23:55:50,993 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-22 23:55:51,079 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:55:51,079 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 23:55:51,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:51 BoogieIcfgContainer [2018-11-22 23:55:51,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:55:51,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:55:51,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:55:51,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:55:51,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:55:50" (1/3) ... [2018-11-22 23:55:51,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7ffded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:51, skipping insertion in model container [2018-11-22 23:55:51,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:55:50" (2/3) ... [2018-11-22 23:55:51,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7ffded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:55:51, skipping insertion in model container [2018-11-22 23:55:51,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:51" (3/3) ... [2018-11-22 23:55:51,084 INFO L112 eAbstractionObserver]: Analyzing ICFG id_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-22 23:55:51,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:55:51,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:55:51,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:55:51,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:55:51,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:55:51,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:55:51,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:55:51,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:55:51,125 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:55:51,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:55:51,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:55:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-22 23:55:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 23:55:51,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:55:51,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:55:51,146 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:55:51,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2018-11-22 23:55:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:55:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:51,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:55:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:55:51,270 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 23:55:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:55:51,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:55:51,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:55:51,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:55:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:55:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:55:51,288 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-11-22 23:55:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:55:51,318 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-22 23:55:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:55:51,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 23:55:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:55:51,327 INFO L225 Difference]: With dead ends: 33 [2018-11-22 23:55:51,327 INFO L226 Difference]: Without dead ends: 19 [2018-11-22 23:55:51,330 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 23:55:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-22 23:55:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-22 23:55:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 23:55:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-22 23:55:51,361 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-22 23:55:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:55:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-22 23:55:51,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:55:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-22 23:55:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:55:51,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:55:51,363 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:55:51,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:55:51,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2018-11-22 23:55:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:55:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:55:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:55:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 23:55:51,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:55:51,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:55:51,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:55:51,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:55:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:55:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:55:51,421 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2018-11-22 23:55:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:55:51,445 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-22 23:55:51,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:55:51,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-22 23:55:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:55:51,446 INFO L225 Difference]: With dead ends: 31 [2018-11-22 23:55:51,447 INFO L226 Difference]: Without dead ends: 23 [2018-11-22 23:55:51,447 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 23:55:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-22 23:55:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-22 23:55:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:55:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-22 23:55:51,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2018-11-22 23:55:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:55:51,453 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-22 23:55:51,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:55:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-22 23:55:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:55:51,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:55:51,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:55:51,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:55:51,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2018-11-22 23:55:51,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:55:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:55:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:55:51,545 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 23:55:51,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:55:51,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:55:51,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-22 23:55:51,547 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [27], [28], [29], [30], [31], [33], [34], [35], [36] [2018-11-22 23:55:51,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:55:51,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:55:51,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:55:51,725 INFO L272 AbstractInterpreter]: Visited 18 different actions 59 times. Merged at 6 different actions 20 times. Never widened. Performed 157 root evaluator evaluations with a maximum evaluation depth of 5. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-22 23:55:51,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:51,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:55:51,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:55:51,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/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 23:55:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:51,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:55:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:55:51,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:55:51,837 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 23:55:51,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:55:51,945 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 23:55:51,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:55:51,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2018-11-22 23:55:51,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:55:51,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 23:55:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:55:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:55:51,962 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2018-11-22 23:55:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:55:51,989 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-22 23:55:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:55:51,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-22 23:55:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:55:51,989 INFO L225 Difference]: With dead ends: 27 [2018-11-22 23:55:51,989 INFO L226 Difference]: Without dead ends: 23 [2018-11-22 23:55:51,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:55:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-22 23:55:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-22 23:55:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:55:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-22 23:55:51,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-11-22 23:55:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:55:51,992 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-22 23:55:51,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 23:55:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-22 23:55:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:55:51,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:55:51,993 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:55:51,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:55:51,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2018-11-22 23:55:51,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:55:51,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:51,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:51,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:55:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:55:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-22 23:55:52,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:55:52,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:55:52,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:55:52,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:55:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:55:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:55:52,039 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-22 23:55:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:55:52,047 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-22 23:55:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:55:52,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-22 23:55:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:55:52,048 INFO L225 Difference]: With dead ends: 29 [2018-11-22 23:55:52,048 INFO L226 Difference]: Without dead ends: 25 [2018-11-22 23:55:52,048 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 23:55:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-22 23:55:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-22 23:55:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:55:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-22 23:55:52,051 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 27 [2018-11-22 23:55:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:55:52,052 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-22 23:55:52,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:55:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-22 23:55:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 23:55:52,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:55:52,053 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:55:52,053 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:55:52,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:55:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2018-11-22 23:55:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:55:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:52,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:55:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:55:52,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:55:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:55:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:55:52,085 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #30#return; [?] CALL call #t~ret3 := main(); [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=2] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #36#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1] [?] assume !(~ret~0 > 3);#res := ~ret~0; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #36#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2] [?] assume !(~ret~0 > 3);#res := ~ret~0; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #34#return; VAL [main_~input~0=2, |main_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=2, main_~result~0=2] [?] assume 2 == ~result~0; VAL [main_~input~0=2, main_~result~0=2] [?] assume !false; VAL [main_~input~0=2, main_~result~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L9] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L4-L9] ensures true; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L4-L9] ensures true; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14-L16] assume 2 == ~result~0; VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L9] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L4-L9] ensures true; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L4-L9] ensures true; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14-L16] assume 2 == ~result~0; VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [L12] int input = __VERIFIER_nondet_int(); [L13] CALL, EXPR id(input) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id((unsigned int)x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id((unsigned int)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((unsigned int)x-1) VAL [\old(x)=1, id((unsigned int)x-1)=0, x=1] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L6] RET, EXPR id((unsigned int)x-1) VAL [\old(x)=2, id((unsigned int)x-1)=1, x=2] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L13] RET, EXPR id(input) VAL [id(input)=2, input=2] [L13] int result = id(input); [L14] COND TRUE result == 2 VAL [input=2, result=2] [L15] __VERIFIER_error() VAL [input=2, result=2] ----- [2018-11-22 23:55:52,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:55:52 BoogieIcfgContainer [2018-11-22 23:55:52,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:55:52,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:55:52,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:55:52,112 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:55:52,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:55:51" (3/4) ... [2018-11-22 23:55:52,114 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 #30#return; [?] CALL call #t~ret3 := main(); [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=2] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #36#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1] [?] assume !(~ret~0 > 3);#res := ~ret~0; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~ret~0=1, id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #36#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2] [?] assume !(~ret~0 > 3);#res := ~ret~0; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #34#return; VAL [main_~input~0=2, |main_#t~ret2|=2] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=2, main_~result~0=2] [?] assume 2 == ~result~0; VAL [main_~input~0=2, main_~result~0=2] [?] assume !false; VAL [main_~input~0=2, main_~result~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L9] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L4-L9] ensures true; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L4-L9] ensures true; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14-L16] assume 2 == ~result~0; VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L9] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L4-L9] ensures true; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] assume !(~ret~0 > 3); [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L4-L9] ensures true; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14-L16] assume 2 == ~result~0; VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~input~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [~input~0=2] [L13] CALL call #t~ret2 := id(~input~0); VAL [#in~x=2] [L4-L9] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1] [L4-L9] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=0] [L4-L9] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, ~ret~0=1, ~x=1] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=1, #res=1, ~ret~0=1, ~x=1] [L6] RET call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] ~ret~0 := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, ~ret~0=2, ~x=2] [L7] COND FALSE !(~ret~0 > 3) [L8] #res := ~ret~0; VAL [#in~x=2, #res=2, ~ret~0=2, ~x=2] [L13] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=2, ~input~0=2] [L13] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L13] ~result~0 := #t~ret2; [L13] havoc #t~ret2; VAL [~input~0=2, ~result~0=2] [L14] COND TRUE 2 == ~result~0 VAL [~input~0=2, ~result~0=2] [L15] assert false; VAL [~input~0=2, ~result~0=2] [L12] int input = __VERIFIER_nondet_int(); [L13] CALL, EXPR id(input) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id((unsigned int)x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id((unsigned int)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((unsigned int)x-1) VAL [\old(x)=1, id((unsigned int)x-1)=0, x=1] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L6] RET, EXPR id((unsigned int)x-1) VAL [\old(x)=2, id((unsigned int)x-1)=1, x=2] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L13] RET, EXPR id(input) VAL [id(input)=2, input=2] [L13] int result = id(input); [L14] COND TRUE result == 2 VAL [input=2, result=2] [L15] __VERIFIER_error() VAL [input=2, result=2] ----- [2018-11-22 23:55:52,154 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_39bb93b5-4065-4b21-b3b6-8e7d0f96d93a/bin-2019/utaipan/witness.graphml [2018-11-22 23:55:52,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:55:52,155 INFO L168 Benchmark]: Toolchain (without parser) took 1405.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -73.7 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,156 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:55:52,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:55:52,157 INFO L168 Benchmark]: Boogie Preprocessor took 11.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,157 INFO L168 Benchmark]: RCFGBuilder took 157.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,158 INFO L168 Benchmark]: TraceAbstraction took 1031.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,158 INFO L168 Benchmark]: Witness Printer took 42.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:55:52,160 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.87 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.42 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1031.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = __VERIFIER_nondet_int(); [L13] CALL, EXPR id(input) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id((unsigned int)x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id((unsigned int)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((unsigned int)x-1) VAL [\old(x)=1, id((unsigned int)x-1)=0, x=1] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L6] RET, EXPR id((unsigned int)x-1) VAL [\old(x)=2, id((unsigned int)x-1)=1, x=2] [L6] int ret = id((unsigned int)x-1) + 1; [L7] COND FALSE !(ret > 3) [L8] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L13] RET, EXPR id(input) VAL [id(input)=2, input=2] [L13] int result = id(input); [L14] COND TRUE result == 2 VAL [input=2, result=2] [L15] __VERIFIER_error() VAL [input=2, result=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 6 SDslu, 263 SDs, 0 SdLazy, 55 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=3, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 3632 SizeOfPredicates, 2 NumberOfNonLiveVariables, 51 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 25/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...