./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a7af5709195f6c1eec73f2559f8e654af4840835 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:53:53,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:53:53,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:53:53,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:53:53,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:53:53,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:53:53,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:53:53,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:53:53,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:53:53,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:53:53,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:53:53,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:53:53,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:53:53,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:53:53,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:53:53,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:53:53,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:53:53,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:53:53,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:53:53,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:53:53,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:53:53,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:53:53,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:53:53,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:53:53,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:53:53,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:53:53,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:53:53,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:53:53,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:53:53,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:53:53,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:53:53,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:53:53,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:53:53,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:53:53,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:53:53,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:53:53,072 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 06:53:53,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:53:53,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:53:53,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:53:53,082 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:53:53,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:53:53,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:53:53,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:53:53,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 06:53:53,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:53:53,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:53:53,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:53:53,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:53:53,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7af5709195f6c1eec73f2559f8e654af4840835 [2018-11-23 06:53:53,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:53:53,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:53:53,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:53:53,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:53:53,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:53:53,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 06:53:53,156 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/data/5be7c28b9/7dc933f1fcb54a5d90a97aaf1c03ee65/FLAGb383d0826 [2018-11-23 06:53:53,558 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:53:53,558 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 06:53:53,563 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/data/5be7c28b9/7dc933f1fcb54a5d90a97aaf1c03ee65/FLAGb383d0826 [2018-11-23 06:53:53,573 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/data/5be7c28b9/7dc933f1fcb54a5d90a97aaf1c03ee65 [2018-11-23 06:53:53,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:53:53,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:53:53,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:53:53,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:53:53,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:53:53,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53, skipping insertion in model container [2018-11-23 06:53:53,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:53:53,599 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:53:53,704 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:53:53,706 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:53:53,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:53:53,725 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:53:53,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53 WrapperNode [2018-11-23 06:53:53,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:53:53,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:53:53,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:53:53,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:53:53,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:53:53,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:53:53,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:53:53,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:53:53,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... [2018-11-23 06:53:53,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:53:53,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:53:53,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:53:53,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:53:53,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:53:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:53:53,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:53:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-23 06:53:53,821 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-23 06:53:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:53:53,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:53:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:53:53,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:53:53,936 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:53:53,936 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:53:53,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:53 BoogieIcfgContainer [2018-11-23 06:53:53,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:53:53,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:53:53,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:53:53,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:53:53,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:53:53" (1/3) ... [2018-11-23 06:53:53,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df1408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:53:53, skipping insertion in model container [2018-11-23 06:53:53,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:53" (2/3) ... [2018-11-23 06:53:53,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df1408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:53:53, skipping insertion in model container [2018-11-23 06:53:53,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:53" (3/3) ... [2018-11-23 06:53:53,941 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative_false-no-overflow.c [2018-11-23 06:53:53,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:53:53,951 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 06:53:53,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 06:53:53,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:53:53,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:53:53,981 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:53:53,981 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:53:53,981 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:53:53,981 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:53:53,981 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:53:53,981 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:53:53,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:53:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 06:53:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:53:53,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:53,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:53,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1930860990, now seen corresponding path program 1 times [2018-11-23 06:53:54,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,115 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-23 06:53:54,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:53:54,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,128 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-11-23 06:53:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,236 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-23 06:53:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:53:54,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 06:53:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,244 INFO L225 Difference]: With dead ends: 85 [2018-11-23 06:53:54,244 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 06:53:54,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:53:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 06:53:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-23 06:53:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 06:53:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 06:53:54,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2018-11-23 06:53:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,277 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 06:53:54,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 06:53:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:53:54,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -272844401, now seen corresponding path program 1 times [2018-11-23 06:53:54,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,304 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-23 06:53:54,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:53:54,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,306 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-23 06:53:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,409 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-23 06:53:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:53:54,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 06:53:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,412 INFO L225 Difference]: With dead ends: 62 [2018-11-23 06:53:54,412 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 06:53:54,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:53:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 06:53:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-11-23 06:53:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 06:53:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-23 06:53:54,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12 [2018-11-23 06:53:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,422 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-23 06:53:54,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 06:53:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 06:53:54,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,423 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,423 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash 757868177, now seen corresponding path program 1 times [2018-11-23 06:53:54,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:53:54,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,457 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 5 states. [2018-11-23 06:53:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,521 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-23 06:53:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:53:54,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 06:53:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,522 INFO L225 Difference]: With dead ends: 80 [2018-11-23 06:53:54,522 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 06:53:54,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:53:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 06:53:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-11-23 06:53:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 06:53:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-23 06:53:54,533 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 17 [2018-11-23 06:53:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,533 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-23 06:53:54,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-23 06:53:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:53:54,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,534 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash 809703757, now seen corresponding path program 1 times [2018-11-23 06:53:54,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:54,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:53:54,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,579 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states. [2018-11-23 06:53:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,635 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 06:53:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:53:54,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 06:53:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,637 INFO L225 Difference]: With dead ends: 124 [2018-11-23 06:53:54,637 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 06:53:54,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:53:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 06:53:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-11-23 06:53:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 06:53:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2018-11-23 06:53:54,646 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 18 [2018-11-23 06:53:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,646 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2018-11-23 06:53:54,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-23 06:53:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 06:53:54,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,647 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,647 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash -668980256, now seen corresponding path program 1 times [2018-11-23 06:53:54,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:54,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:53:54,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,684 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2018-11-23 06:53:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,750 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2018-11-23 06:53:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:53:54,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 06:53:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,751 INFO L225 Difference]: With dead ends: 105 [2018-11-23 06:53:54,752 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 06:53:54,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:53:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 06:53:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-11-23 06:53:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 06:53:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-11-23 06:53:54,764 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19 [2018-11-23 06:53:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,764 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-11-23 06:53:54,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-23 06:53:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:53:54,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,765 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,765 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2531206, now seen corresponding path program 1 times [2018-11-23 06:53:54,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:53:54,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:53:54,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:53:54,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:53:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:53:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:53:54,807 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 5 states. [2018-11-23 06:53:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:54,847 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2018-11-23 06:53:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:53:54,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 06:53:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:54,849 INFO L225 Difference]: With dead ends: 136 [2018-11-23 06:53:54,850 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 06:53:54,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:53:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 06:53:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-23 06:53:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 06:53:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-23 06:53:54,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-11-23 06:53:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:54,856 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-23 06:53:54,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:53:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-23 06:53:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 06:53:54,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:54,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:54,858 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:54,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -484323025, now seen corresponding path program 1 times [2018-11-23 06:53:54,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:54,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:54,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:53:54,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:53:54,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:54,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:53:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 06:53:54,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:53:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:53:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:53:54,958 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-11-23 06:53:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:55,028 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 06:53:55,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:53:55,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 06:53:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:55,029 INFO L225 Difference]: With dead ends: 70 [2018-11-23 06:53:55,029 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 06:53:55,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:53:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 06:53:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-23 06:53:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 06:53:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-23 06:53:55,038 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-11-23 06:53:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:55,038 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-23 06:53:55,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:53:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 06:53:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:53:55,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:55,039 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:55,039 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:55,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2129111832, now seen corresponding path program 1 times [2018-11-23 06:53:55,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:55,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:55,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:53:55,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:53:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:53:55,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:53:55,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 06:53:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:53:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:53:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:53:55,136 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 7 states. [2018-11-23 06:53:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:55,186 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 06:53:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:53:55,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 06:53:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:55,189 INFO L225 Difference]: With dead ends: 62 [2018-11-23 06:53:55,189 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 06:53:55,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:53:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 06:53:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 06:53:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 06:53:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-23 06:53:55,202 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-11-23 06:53:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:55,202 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-23 06:53:55,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:53:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-23 06:53:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 06:53:55,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:55,204 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:55,204 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:55,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1178899970, now seen corresponding path program 1 times [2018-11-23 06:53:55,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:55,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:53:55,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:53:55,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:53:55,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:53:55,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:53:55,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-23 06:53:55,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 06:53:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:53:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:53:55,350 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-11-23 06:53:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:55,518 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-11-23 06:53:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:53:55,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 06:53:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:55,519 INFO L225 Difference]: With dead ends: 97 [2018-11-23 06:53:55,519 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 06:53:55,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:53:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 06:53:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-11-23 06:53:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 06:53:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-11-23 06:53:55,527 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 28 [2018-11-23 06:53:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:55,528 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-11-23 06:53:55,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 06:53:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-11-23 06:53:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 06:53:55,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:55,528 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:55,529 INFO L423 AbstractCegarLoop]: === Iteration 10 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:55,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2108806649, now seen corresponding path program 1 times [2018-11-23 06:53:55,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:55,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:53:55,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:53:55,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:53:55,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:55,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:53:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:53:55,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 06:53:55,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:53:55,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:53:55,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:53:55,611 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 7 states. [2018-11-23 06:53:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:53:55,651 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-23 06:53:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:53:55,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 06:53:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:53:55,652 INFO L225 Difference]: With dead ends: 88 [2018-11-23 06:53:55,652 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 06:53:55,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:53:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 06:53:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 06:53:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 06:53:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-23 06:53:55,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 29 [2018-11-23 06:53:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:53:55,656 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-23 06:53:55,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:53:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 06:53:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 06:53:55,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:53:55,657 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:53:55,658 INFO L423 AbstractCegarLoop]: === Iteration 11 === [multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:53:55,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash -880204174, now seen corresponding path program 1 times [2018-11-23 06:53:55,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:53:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:53:55,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:53:55,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:53:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:55,691 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #55#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=1073741824] [?] assume !(~m~0 < 0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=1073741824, main_~n~0=2] [?] assume !(~n~0 < 0); VAL [main_~m~0=1073741824, main_~n~0=2] [?] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [|mult_#in~m|=2, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] RET #53#return; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] assume true; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] RET #53#return; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] ----- [2018-11-23 06:53:55,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:53:55 BoogieIcfgContainer [2018-11-23 06:53:55,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:53:55,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:53:55,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:53:55,728 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:53:55,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:53" (3/4) ... [2018-11-23 06:53:55,731 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 #55#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=1073741824] [?] assume !(~m~0 < 0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=1073741824, main_~n~0=2] [?] assume !(~n~0 < 0); VAL [main_~m~0=1073741824, main_~n~0=2] [?] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [|mult_#in~m|=2, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] RET #53#return; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] assume true; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] RET #53#return; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] ----- [2018-11-23 06:53:55,775 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b88bbf21-0402-4ef1-a08a-2a066008039d/bin-2019/uautomizer/witness.graphml [2018-11-23 06:53:55,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:53:55,775 INFO L168 Benchmark]: Toolchain (without parser) took 2200.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 959.1 MB in the beginning and 858.8 MB in the end (delta: 100.3 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:55,776 INFO L168 Benchmark]: CDTParser took 0.10 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-23 06:53:55,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.53 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-23 06:53:55,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.64 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-23 06:53:55,778 INFO L168 Benchmark]: Boogie Preprocessor took 11.40 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:53:55,778 INFO L168 Benchmark]: RCFGBuilder took 187.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:55,778 INFO L168 Benchmark]: TraceAbstraction took 1790.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.1 MB in the end (delta: 278.3 MB). Peak memory consumption was 278.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:55,778 INFO L168 Benchmark]: Witness Printer took 47.02 ms. Allocated memory is still 1.2 GB. Free memory was 862.1 MB in the beginning and 858.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:55,780 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.10 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 149.53 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.64 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. * Boogie Preprocessor took 11.40 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1790.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.1 MB in the end (delta: 278.3 MB). Peak memory consumption was 278.3 MB. Max. memory is 11.5 GB. * Witness Printer took 47.02 ms. Allocated memory is still 1.2 GB. Free memory was 862.1 MB in the beginning and 858.8 MB 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: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 6 error locations. UNSAFE Result, 1.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 310 SDslu, 749 SDs, 0 SdLazy, 604 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 13709 SizeOfPredicates, 5 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 40/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...