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/loop-acceleration/simple_false-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:05:57,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:05:57,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:05:57,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:05:57,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:05:57,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:05:57,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:05:57,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:05:57,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:05:57,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:05:57,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:05:57,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:05:57,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:05:57,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:05:57,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:05:57,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:05:57,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:05:57,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:05:57,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:05:57,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:05:57,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:05:57,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:05:57,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:05:57,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:05:57,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:05:57,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:05:57,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:05:57,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:05:57,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:05:57,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:05:57,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:05:57,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:05:57,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:05:57,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:05:57,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:05:57,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:05:57,593 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:05:57,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:05:57,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:05:57,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:05:57,611 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:05:57,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:05:57,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:05:57,612 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:05:57,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:05:57,613 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:05:57,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:05:57,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:05:57,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:05:57,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:05:57,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:05:57,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:05:57,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:05:57,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:05:57,615 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:05:57,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:05:57,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:05:57,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:05:57,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:05:57,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:05:57,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:05:57,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:05:57,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:05:57,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:05:57,617 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:05:57,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:05:57,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:05:57,618 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:05:57,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:05:57,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:05:57,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:05:57,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:05:57,686 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:05:57,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call3_true-termination.i [2018-11-23 13:05:57,749 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ce4f920/17dccfc246624a7eb4e98981a1f59664/FLAG9bcb67448 [2018-11-23 13:05:58,254 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:05:58,255 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call3_true-termination.i [2018-11-23 13:05:58,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ce4f920/17dccfc246624a7eb4e98981a1f59664/FLAG9bcb67448 [2018-11-23 13:05:58,621 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ce4f920/17dccfc246624a7eb4e98981a1f59664 [2018-11-23 13:05:58,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:05:58,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:05:58,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:05:58,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:05:58,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:05:58,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aae84c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58, skipping insertion in model container [2018-11-23 13:05:58,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:05:58,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:05:58,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:05:58,862 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:05:58,880 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:05:58,897 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:05:58,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58 WrapperNode [2018-11-23 13:05:58,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:05:58,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:05:58,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:05:58,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:05:58,909 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:05:58" (1/1) ... [2018-11-23 13:05:58,915 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:05:58" (1/1) ... [2018-11-23 13:05:58,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:05:58,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:05:58,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:05:58,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:05:58,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (1/1) ... [2018-11-23 13:05:58,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:05:58,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:05:58,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:05:58,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:05:58,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (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:05:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:05:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:05:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:05:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:05:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:05:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:05:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:05:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:05:59,615 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:05:59,615 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:05:59,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:59 BoogieIcfgContainer [2018-11-23 13:05:59,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:05:59,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:05:59,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:05:59,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:05:59,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:05:58" (1/3) ... [2018-11-23 13:05:59,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5163af23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:59, skipping insertion in model container [2018-11-23 13:05:59,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:58" (2/3) ... [2018-11-23 13:05:59,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5163af23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:59, skipping insertion in model container [2018-11-23 13:05:59,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:59" (3/3) ... [2018-11-23 13:05:59,624 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call3_true-termination.i [2018-11-23 13:05:59,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:05:59,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:05:59,654 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:05:59,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:05:59,689 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:05:59,689 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:05:59,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:05:59,690 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:05:59,690 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:05:59,690 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:05:59,690 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:05:59,691 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:05:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:05:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:05:59,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:59,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:59,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:59,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:05:59,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:59,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:05:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:05:59,869 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret0 := main(); [?] ~x~0 := 0;havoc ~N~0; VAL [main_~x~0=0] [?] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [main_~N~0=0, main_~x~0=0] [?] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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] [L9] unsigned int x = 0; [L10] unsigned short N; VAL [x=0] [L11] COND FALSE !(x < N) VAL [N=0, x=0] [L14] CALL __VERIFIER_assert(x % 2) 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:05:59,904 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:05:59,904 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:05:59,904 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:05:59,904 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:05:59,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:05:59,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:05:59,905 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:05:59,905 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:05:59,905 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:05:59,906 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:05:59,907 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:05:59,908 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:05:59,908 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:05:59,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:05:59 BoogieIcfgContainer [2018-11-23 13:05:59,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:05:59,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:05:59,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:05:59,912 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:05:59,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:59" (3/4) ... [2018-11-23 13:05:59,915 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 #31#return; [?] CALL call #t~ret0 := main(); [?] ~x~0 := 0;havoc ~N~0; VAL [main_~x~0=0] [?] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [main_~N~0=0, main_~x~0=0] [?] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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~ret0 := main(); [L9] ~x~0 := 0; [L10] havoc ~N~0; VAL [~x~0=0] [L11-L13] COND TRUE !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296) VAL [~N~0=0, ~x~0=0] [L14] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); 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] [L9] unsigned int x = 0; [L10] unsigned short N; VAL [x=0] [L11] COND FALSE !(x < N) VAL [N=0, x=0] [L14] CALL __VERIFIER_assert(x % 2) 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:05:59,967 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/simple_false-unreach-call3_true-termination.i-witness.graphml [2018-11-23 13:05:59,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:05:59,969 INFO L168 Benchmark]: Toolchain (without parser) took 1336.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:05:59,971 INFO L168 Benchmark]: CDTParser took 0.27 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:05:59,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.57 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:05:59,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.36 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:05:59,973 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 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:05:59,974 INFO L168 Benchmark]: RCFGBuilder took 661.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:59,975 INFO L168 Benchmark]: TraceAbstraction took 294.62 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:59,975 INFO L168 Benchmark]: Witness Printer took 55.68 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:05:59,980 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.27 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 263.57 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.36 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 30.90 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 661.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 294.62 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Witness Printer took 55.68 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. 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: [L9] unsigned int x = 0; [L10] unsigned short N; VAL [x=0] [L11] COND FALSE !(x < N) VAL [N=0, x=0] [L14] CALL __VERIFIER_assert(x % 2) 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, 17 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...