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-invariants/bin-suffix-5_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:42,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:42,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:42,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:42,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:42,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:42,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:42,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:42,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:42,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:42,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:42,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:42,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:42,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:42,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:42,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:42,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:42,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:42,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:42,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:42,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:42,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:42,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:42,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:42,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:42,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:42,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:42,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:42,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:42,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:42,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:42,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:42,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:42,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:42,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:42,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:42,394 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:16:42,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:42,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:42,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:42,411 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:42,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:42,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:42,412 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:42,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:42,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:42,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:42,416 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:42,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:42,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:42,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:42,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:42,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:42,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:42,417 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:42,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:42,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:42,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:42,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:42,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:42,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:42,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:42,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:42,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:42,420 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:42,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:42,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:42,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:42,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:42,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:42,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:42,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:42,486 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:42,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/bin-suffix-5_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:16:42,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1714b1414/c6fd38b1406a4c289ad0e38b29c6aeae/FLAG6ce28033b [2018-11-23 13:16:42,960 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:42,961 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/bin-suffix-5_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:16:42,970 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1714b1414/c6fd38b1406a4c289ad0e38b29c6aeae/FLAG6ce28033b [2018-11-23 13:16:43,311 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1714b1414/c6fd38b1406a4c289ad0e38b29c6aeae [2018-11-23 13:16:43,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:43,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:43,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:43,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:43,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:43,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc1b846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43, skipping insertion in model container [2018-11-23 13:16:43,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:43,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:43,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:43,618 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:43,638 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:43,658 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:43,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43 WrapperNode [2018-11-23 13:16:43,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:43,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:43,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:43,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:43,670 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:16:43" (1/1) ... [2018-11-23 13:16:43,676 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:16:43" (1/1) ... [2018-11-23 13:16:43,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:43,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:43,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:43,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:43,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (1/1) ... [2018-11-23 13:16:43,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:43,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:43,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:43,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:43,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (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:16:43,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:43,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:16:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:16:44,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:44,239 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:16:44,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:44 BoogieIcfgContainer [2018-11-23 13:16:44,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:44,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:44,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:44,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:44,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:43" (1/3) ... [2018-11-23 13:16:44,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4b6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:44, skipping insertion in model container [2018-11-23 13:16:44,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:43" (2/3) ... [2018-11-23 13:16:44,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4b6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:44, skipping insertion in model container [2018-11-23 13:16:44,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:44" (3/3) ... [2018-11-23 13:16:44,248 INFO L112 eAbstractionObserver]: Analyzing ICFG bin-suffix-5_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-23 13:16:44,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:44,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:44,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:44,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:44,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:44,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:44,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:44,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:44,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:44,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:44,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:44,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:16:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:44,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:44,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:44,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:44,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-23 13:16:44,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:44,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:44,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:44,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:44,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:16:44,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:16:44,491 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-23 13:16:44,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-23 13:16:44,492 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 5; {22#true} is VALID [2018-11-23 13:16:44,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:16:44,493 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); {23#false} is VALID [2018-11-23 13:16:44,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:16:44,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:16:44,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:16:44,497 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:16:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:44,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:44,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:44,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:44,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:44,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:44,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:44,576 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:16:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:44,682 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 13:16:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:44,682 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:16:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:16:44,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:16:44,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:44,857 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:16:44,857 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:16:44,861 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:16:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:16:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:16:44,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:44,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:44,988 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:44,988 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:44,991 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:16:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:16:44,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:44,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:44,993 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:44,993 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:44,996 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:16:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:16:44,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:44,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:44,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:44,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:16:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:16:45,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:16:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:45,002 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:16:45,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:16:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:16:45,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:45,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:45,004 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:45,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1890620952, now seen corresponding path program 1 times [2018-11-23 13:16:45,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:45,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:16:45,059 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #33#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 5; VAL [main_~x~0=5] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [main_~x~0=5, |main_#t~nondet0|=0] [?] assume !(0 != #t~nondet0);havoc #t~nondet0; VAL [main_~x~0=5] [?] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] assume !(0 != #t~nondet0); [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] assume !(0 != #t~nondet0); [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L10] unsigned int x = 5; VAL [x=5] [L11] COND FALSE !(__VERIFIER_nondet_int()) [L14] CALL __VERIFIER_assert((x & 5) == 5) 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:16:45,089 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:16:45,090 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:16:45,090 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:16:45,090 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:16:45,090 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:16:45,090 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:16:45,091 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:16:45,092 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:16:45,093 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:16:45,093 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:16:45,093 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:16:45,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:16:45,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:16:45,093 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:16:45,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:16:45 BoogieIcfgContainer [2018-11-23 13:16:45,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:16:45,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:16:45,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:16:45,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:16:45,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:44" (3/4) ... [2018-11-23 13:16:45,101 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 #33#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 5; VAL [main_~x~0=5] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [main_~x~0=5, |main_#t~nondet0|=0] [?] assume !(0 != #t~nondet0);havoc #t~nondet0; VAL [main_~x~0=5] [?] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] assume !(0 != #t~nondet0); [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] assume !(0 != #t~nondet0); [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] 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~ret1 := main(); [L10] ~x~0 := 5; VAL [~x~0=5] [L11] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#t~nondet0=0, ~x~0=5] [L11-L13] COND TRUE !(0 != #t~nondet0) [L11] havoc #t~nondet0; VAL [~x~0=5] [L14] CALL call __VERIFIER_assert((if 5 == ~bitwiseAnd(~x~0, 5) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L10] unsigned int x = 5; VAL [x=5] [L11] COND FALSE !(__VERIFIER_nondet_int()) [L14] CALL __VERIFIER_assert((x & 5) == 5) 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:16:45,162 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invariants/bin-suffix-5_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c-witness.graphml [2018-11-23 13:16:45,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:16:45,164 INFO L168 Benchmark]: Toolchain (without parser) took 1843.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -718.4 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:16:45,166 INFO L168 Benchmark]: CDTParser took 0.21 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:16:45,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.92 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:16:45,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.28 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:16:45,170 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 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:16:45,170 INFO L168 Benchmark]: RCFGBuilder took 524.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:16:45,173 INFO L168 Benchmark]: TraceAbstraction took 856.24 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: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:16:45,174 INFO L168 Benchmark]: Witness Printer took 65.24 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:16:45,183 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.21 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 336.92 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.28 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.73 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 524.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 856.24 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: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. * Witness Printer took 65.24 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: [L10] unsigned int x = 5; VAL [x=5] [L11] COND FALSE !(__VERIFIER_nondet_int()) [L14] CALL __VERIFIER_assert((x & 5) == 5) 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, 19 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 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=19occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...