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/terminator_01_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:50,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:50,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:50,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:50,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:50,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:50,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:50,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:50,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:50,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:50,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:50,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:50,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:50,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:50,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:50,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:50,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:50,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:50,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:50,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:50,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:50,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:50,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:50,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:50,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:50,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:50,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:50,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:50,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:50,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:50,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:50,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:50,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:50,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:50,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:50,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:50,912 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:50,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:50,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:50,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:50,943 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:50,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:50,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:50,944 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:50,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:50,948 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:50,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:50,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:50,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:50,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:50,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:50,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:50,949 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:50,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:50,949 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:50,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:50,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:50,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:50,950 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:50,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:50,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:50,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:50,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:50,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:50,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:50,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:50,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:50,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:51,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:51,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:51,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:51,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:51,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:51,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/terminator_01_false-unreach-call_true-termination.i [2018-11-23 13:02:51,093 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a47cf06/960986307eee453ba34366ca3dcdf252/FLAG025ca1268 [2018-11-23 13:02:51,584 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:51,585 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/terminator_01_false-unreach-call_true-termination.i [2018-11-23 13:02:51,591 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a47cf06/960986307eee453ba34366ca3dcdf252/FLAG025ca1268 [2018-11-23 13:02:51,935 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a47cf06/960986307eee453ba34366ca3dcdf252 [2018-11-23 13:02:51,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:51,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:51,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:51,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:51,951 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:51,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:51" (1/1) ... [2018-11-23 13:02:51,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a187f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:51, skipping insertion in model container [2018-11-23 13:02:51,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:51" (1/1) ... [2018-11-23 13:02:51,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:51,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:52,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:52,224 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:52,244 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:52,264 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:52,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:52 WrapperNode [2018-11-23 13:02:52,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:52,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:52,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:52,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:52,275 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:52" (1/1) ... [2018-11-23 13:02:52,283 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:52" (1/1) ... [2018-11-23 13:02:52,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:52,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:52,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:52,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:52,299 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:52" (1/1) ... [2018-11-23 13:02:52,299 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:52" (1/1) ... [2018-11-23 13:02:52,300 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:52" (1/1) ... [2018-11-23 13:02:52,301 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:52" (1/1) ... [2018-11-23 13:02:52,308 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:52" (1/1) ... [2018-11-23 13:02:52,313 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:52" (1/1) ... [2018-11-23 13:02:52,314 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:52" (1/1) ... [2018-11-23 13:02:52,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:52,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:52,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:52,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:52,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:52" (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:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:02:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:02:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:52,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:52,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:52,875 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:52,876 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:52,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:52 BoogieIcfgContainer [2018-11-23 13:02:52,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:52,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:52,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:52,881 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:52,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:51" (1/3) ... [2018-11-23 13:02:52,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c77aa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:52, skipping insertion in model container [2018-11-23 13:02:52,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:52" (2/3) ... [2018-11-23 13:02:52,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c77aa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:52, skipping insertion in model container [2018-11-23 13:02:52,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:52" (3/3) ... [2018-11-23 13:02:52,885 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_01_false-unreach-call_true-termination.i [2018-11-23 13:02:52,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:52,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:52,921 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:52,954 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:52,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:52,956 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:52,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:52,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:52,957 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:52,957 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:52,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:52,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:02:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:02:52,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:52,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:52,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:52,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash -564387615, now seen corresponding path program 1 times [2018-11-23 13:02:52,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:53,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:02:53,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23#true} is VALID [2018-11-23 13:02:53,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:02:53,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #34#return; {23#true} is VALID [2018-11-23 13:02:53,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2018-11-23 13:02:53,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4);havoc #t~nondet0;~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; {23#true} is VALID [2018-11-23 13:02:53,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 13:02:53,170 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert(0); {24#false} is VALID [2018-11-23 13:02:53,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 13:02:53,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:02:53,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:02:53,174 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:53,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:53,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:53,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:02:53,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:53,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:53,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:53,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:53,268 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:02:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,354 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:02:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:53,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:02:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:02:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:02:53,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 13:02:53,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,748 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:02:53,748 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:02:53,752 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:02:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:02:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:02:53,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:53,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:53,797 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:53,797 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,801 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:02:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:02:53,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,802 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:53,802 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,808 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:02:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:02:53,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:53,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:02:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:02:53,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:02:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:53,818 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:02:53,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:02:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:02:53,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:53,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:53,820 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:53,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -538271495, now seen corresponding path program 1 times [2018-11-23 13:02:53,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:53,913 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] RET #34#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4);havoc #t~nondet0;~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem1|=101, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] assume !(#t~mem1 < 100);havoc #t~mem1; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] CALL call __VERIFIER_assert(0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:53,952 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:53,953 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:53,954 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:02:53,955 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:02:53,956 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:53,956 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:53,956 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:53,956 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:02:53,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:53 BoogieIcfgContainer [2018-11-23 13:02:53,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:53,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:53,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:53,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:53,960 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:52" (3/4) ... [2018-11-23 13:02:53,963 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=102] [?] RET #34#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4);havoc #t~nondet0;~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem1|=101, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] assume !(#t~mem1 < 100);havoc #t~mem1; VAL [main_~p~0.base=103, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=103, |main_~#x~0.offset|=0] [?] CALL call __VERIFIER_assert(0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=102, old(#NULL.base)=104, old(#NULL.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=104, old(#NULL.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~init~int(#t~nondet0, ~#x~0.base, ~#x~0.offset, 4); [L13] havoc #t~nondet0; [L14] ~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16] call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem1=101, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L16-L18] assume !(#t~mem1 < 100); [L16] havoc #t~mem1; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=103, ~#x~0.offset=0, ~p~0.base=103, ~p~0.offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=102, old(#NULL!base)=104, old(#NULL!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=104, old(#NULL!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#x~0 := #Ultimate.alloc(4); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~init~int(#t~nondet0, ~#x~0, 4); [L13] havoc #t~nondet0; [L14] ~p~0 := ~#x~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16] FCALL call #t~mem1 := read~int(~#x~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem1=101, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L16-L18] COND TRUE !(#t~mem1 < 100) [L16] havoc #t~mem1; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=103, ~#x~0!offset=0, ~p~0!base=103, ~p~0!offset=0] [L19] CALL call __VERIFIER_assert(0); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:54,016 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/terminator_01_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:54,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:54,018 INFO L168 Benchmark]: Toolchain (without parser) took 2073.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -722.6 MB). Peak memory consumption was 6.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,020 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:54,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.49 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:02:54,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.72 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:02:54,022 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 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:02:54,022 INFO L168 Benchmark]: RCFGBuilder took 559.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,023 INFO L168 Benchmark]: TraceAbstraction took 1081.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,024 INFO L168 Benchmark]: Witness Printer took 57.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:54,028 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.49 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.72 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 26.25 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 559.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1081.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. * Witness Printer took 57.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int x=__VERIFIER_nondet_int(); [L13] int x=__VERIFIER_nondet_int(); [L14] int *p = &x; VAL [p={103:0}, x={103:0}] [L16] EXPR \read(x) VAL [\read(x)=101, p={103:0}, x={103:0}] [L16] COND FALSE !(x<100) [L19] CALL __VERIFIER_assert(0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 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=20occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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...