java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/trex03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:57,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:57,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:57,685 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:57,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:57,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:57,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:57,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:57,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:57,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:57,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:57,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:57,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:57,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:57,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:57,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:57,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:57,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:57,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:57,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:57,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:57,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:57,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:57,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:57,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:57,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:57,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:57,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:57,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:57,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:57,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:57,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:57,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:57,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:57,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:57,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:57,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:57,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:57,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:57,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:57,775 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:57,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:57,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:57,776 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:57,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:57,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:57,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:57,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:57,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:57,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:57,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:57,778 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:57,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:57,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:57,778 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:57,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:57,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:57,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:57,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:57,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:57,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:57,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:57,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:57,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:57,781 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:57,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:57,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:57,782 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:57,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:57,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:57,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:57,852 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:57,852 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:57,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex03_false-unreach-call_true-termination.i [2018-11-23 13:02:57,914 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793cb12a/563334e6b714417db0fb65db9c0dde76/FLAG01c0c6229 [2018-11-23 13:02:58,426 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:58,427 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03_false-unreach-call_true-termination.i [2018-11-23 13:02:58,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793cb12a/563334e6b714417db0fb65db9c0dde76/FLAG01c0c6229 [2018-11-23 13:02:58,756 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2793cb12a/563334e6b714417db0fb65db9c0dde76 [2018-11-23 13:02:58,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:58,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:58,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:58,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:58,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:58,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:58" (1/1) ... [2018-11-23 13:02:58,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645c9af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:58, skipping insertion in model container [2018-11-23 13:02:58,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:58" (1/1) ... [2018-11-23 13:02:58,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:58,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:59,044 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:59,049 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:59,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:59,087 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:59,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59 WrapperNode [2018-11-23 13:02:59,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:59,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:59,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:59,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:59,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:59,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:59,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:59,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:59,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... [2018-11-23 13:02:59,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:59,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:59,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:59,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:59,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:02:59,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:59,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:59,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:59,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:59,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:59,715 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:59,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:59 BoogieIcfgContainer [2018-11-23 13:02:59,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:59,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:59,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:59,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:59,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:58" (1/3) ... [2018-11-23 13:02:59,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b7f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:59, skipping insertion in model container [2018-11-23 13:02:59,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:59" (2/3) ... [2018-11-23 13:02:59,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b7f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:59, skipping insertion in model container [2018-11-23 13:02:59,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:59" (3/3) ... [2018-11-23 13:02:59,725 INFO L112 eAbstractionObserver]: Analyzing ICFG trex03_false-unreach-call_true-termination.i [2018-11-23 13:02:59,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:59,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:59,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:59,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:59,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:59,796 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:59,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:59,797 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:59,797 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:59,797 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:59,797 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:59,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:02:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:59,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:59,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:59,826 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:59,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash -859010367, now seen corresponding path program 1 times [2018-11-23 13:02:59,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:59,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:59,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:59,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:02:59,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:02:59,959 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2018-11-23 13:02:59,959 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2018-11-23 13:02:59,959 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1;~d2~0 := 1;~d3~0 := 1;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2018-11-23 13:02:59,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:02:59,967 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2018-11-23 13:02:59,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:02:59,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:02:59,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:02:59,971 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 13:02:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:59,978 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:59,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:59,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:00,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:00,044 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:03:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:00,190 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 13:03:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:00,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:03:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:03:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:03:00,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 13:03:00,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:00,535 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:03:00,535 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:03:00,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:03:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:03:00,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:00,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:00,602 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:00,602 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:00,605 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:03:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:03:00,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:00,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:00,606 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:00,606 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:00,609 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:03:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:03:00,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:00,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:00,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:00,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 13:03:00,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-11-23 13:03:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:00,618 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 13:03:00,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:03:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:03:00,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:00,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:00,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:00,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2018-11-23 13:03:00,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:03:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:03:00,696 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #44#return; [?] CALL call #t~ret7 := main(); [?] ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1;~d2~0 := 1;~d3~0 := 1;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~c1~0=4294967298, main_~c2~0=4294967299, main_~d1~0=1, main_~d2~0=1, main_~d3~0=1, main_~x1~0=4294967297, main_~x2~0=0, main_~x3~0=0] [?] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [main_~c1~0=4294967298, main_~c2~0=4294967299, main_~d1~0=1, main_~d2~0=1, main_~d3~0=1, main_~x1~0=4294967297, main_~x2~0=0, main_~x3~0=0] [?] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=4294967298, c2=4294967299, d1=1, d2=1, d3=1, x1=4294967297, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:03:00,732 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:03:00,733 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2018-11-23 13:03:00,734 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:03:00,735 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:03:00,736 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:03:00,736 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:03:00,736 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:03:00,736 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:03:00,736 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:03:00,736 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:03:00,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:03:00 BoogieIcfgContainer [2018-11-23 13:03:00,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:03:00,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:03:00,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:03:00,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:03:00,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:59" (3/4) ... [2018-11-23 13:03:00,743 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 #44#return; [?] CALL call #t~ret7 := main(); [?] ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1;~d2~0 := 1;~d3~0 := 1;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~c1~0=4294967298, main_~c2~0=4294967299, main_~d1~0=1, main_~d2~0=1, main_~d3~0=1, main_~x1~0=4294967297, main_~x2~0=0, main_~x3~0=0] [?] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [main_~c1~0=4294967298, main_~c2~0=4294967299, main_~d1~0=1, main_~d2~0=1, main_~d3~0=1, main_~x1~0=4294967297, main_~x2~0=0, main_~x3~0=0] [?] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1; [L13] ~d2~0 := 1; [L13] ~d3~0 := 1; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L15-L22] COND TRUE !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0) VAL [~c1~0=4294967298, ~c2~0=4294967299, ~d1~0=1, ~d2~0=1, ~d3~0=1, ~x1~0=4294967297, ~x2~0=0, ~x3~0=0] [L23] CALL call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 && 0 == ~x2~0 % 4294967296) && 0 == ~x3~0 % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=4294967298, c2=4294967299, d1=1, d2=1, d3=1, x1=4294967297, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:03:00,794 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex03_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:03:00,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:03:00,796 INFO L168 Benchmark]: Toolchain (without parser) took 2029.30 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -708.3 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:00,798 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:00,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:00,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:00,800 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:00,800 INFO L168 Benchmark]: RCFGBuilder took 575.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:00,801 INFO L168 Benchmark]: TraceAbstraction took 1022.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:00,802 INFO L168 Benchmark]: Witness Printer took 55.16 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:00,807 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 575.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1022.06 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 7.1 GB. * Witness Printer took 55.16 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=4294967298, c2=4294967299, d1=1, d2=1, d3=1, x1=4294967297, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...