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/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:26,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:26,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:26,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:26,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:26,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:26,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:26,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:26,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:26,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:26,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:26,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:26,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:26,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:26,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:26,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:26,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:26,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:26,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:26,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:26,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:26,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:26,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:26,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:26,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:26,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:26,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:26,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:26,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:26,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:26,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:26,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:26,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:26,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:26,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:26,324 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:26,325 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:03:26,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:26,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:26,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:26,348 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:26,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:26,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:26,349 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:26,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:26,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:26,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:26,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:26,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:26,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:26,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:26,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:26,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:26,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:26,351 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:26,351 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:26,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:26,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:26,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:26,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:26,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:26,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:26,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:26,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:26,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:26,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:26,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:26,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:26,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:26,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:26,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:26,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:26,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:26,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-23 13:03:26,490 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2881770/f39c67f7a0234d14848824d3cfb2ea23/FLAGcfef596c1 [2018-11-23 13:03:26,919 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:26,919 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-23 13:03:26,926 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2881770/f39c67f7a0234d14848824d3cfb2ea23/FLAGcfef596c1 [2018-11-23 13:03:27,310 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2881770/f39c67f7a0234d14848824d3cfb2ea23 [2018-11-23 13:03:27,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:27,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:27,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:27,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:27,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:27,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e822e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27, skipping insertion in model container [2018-11-23 13:03:27,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:27,368 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:27,623 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:27,638 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:27,666 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:27,682 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:27,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27 WrapperNode [2018-11-23 13:03:27,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:27,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:27,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:27,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:27,693 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:03:27" (1/1) ... [2018-11-23 13:03:27,701 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:03:27" (1/1) ... [2018-11-23 13:03:27,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:27,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:27,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:27,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:27,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (1/1) ... [2018-11-23 13:03:27,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:27,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:27,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:27,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:27,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (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:03:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-23 13:03:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-23 13:03:27,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:27,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:27,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:27,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:27,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:27,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:28,471 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:28,471 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:03:28,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:28 BoogieIcfgContainer [2018-11-23 13:03:28,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:28,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:28,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:28,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:28,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:27" (1/3) ... [2018-11-23 13:03:28,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d015e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:28, skipping insertion in model container [2018-11-23 13:03:28,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:27" (2/3) ... [2018-11-23 13:03:28,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d015e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:28, skipping insertion in model container [2018-11-23 13:03:28,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:28" (3/3) ... [2018-11-23 13:03:28,480 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-11-23 13:03:28,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:28,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:28,519 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:28,552 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:28,553 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:28,553 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:28,554 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:28,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:28,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:28,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:28,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:28,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 13:03:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:28,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:28,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:28,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:28,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash -156569802, now seen corresponding path program 1 times [2018-11-23 13:03:28,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:28,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:28,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 13:03:28,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {30#true} is VALID [2018-11-23 13:03:28,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 13:03:28,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #48#return; {30#true} is VALID [2018-11-23 13:03:28,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2018-11-23 13:03:28,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {30#true} is VALID [2018-11-23 13:03:28,813 INFO L256 TraceCheckUtils]: 6: Hoare triple {30#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {30#true} is VALID [2018-11-23 13:03:28,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {30#true} is VALID [2018-11-23 13:03:28,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 13:03:28,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {31#false} is VALID [2018-11-23 13:03:28,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-23 13:03:28,815 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {31#false} {30#true} #52#return; {31#false} is VALID [2018-11-23 13:03:28,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {31#false} is VALID [2018-11-23 13:03:28,816 INFO L256 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert(#t~ret4); {31#false} is VALID [2018-11-23 13:03:28,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 13:03:28,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 13:03:28,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 13:03:28,820 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:03:28,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:28,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:28,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:28,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:28,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:28,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:28,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:29,010 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 13:03:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,267 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 13:03:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:29,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:03:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:03:29,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 13:03:29,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:29,428 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:03:29,428 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:03:29,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:03:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:03:29,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:29,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:29,470 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:29,471 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,475 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:03:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:03:29,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:29,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:29,476 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:29,476 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,479 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:03:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:03:29,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:29,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:29,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:29,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:03:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 13:03:29,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-11-23 13:03:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:29,486 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 13:03:29,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:03:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:03:29,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:29,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:29,487 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:29,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1809996975, now seen corresponding path program 1 times [2018-11-23 13:03:29,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:29,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:29,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:29,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:29,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-23 13:03:29,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {157#true} is VALID [2018-11-23 13:03:29,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2018-11-23 13:03:29,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #48#return; {157#true} is VALID [2018-11-23 13:03:29,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret5 := main(); {157#true} is VALID [2018-11-23 13:03:29,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {157#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {157#true} is VALID [2018-11-23 13:03:29,896 INFO L256 TraceCheckUtils]: 6: Hoare triple {157#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {157#true} is VALID [2018-11-23 13:03:29,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {157#true} is VALID [2018-11-23 13:03:29,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {157#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {157#true} is VALID [2018-11-23 13:03:29,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#true} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {157#true} is VALID [2018-11-23 13:03:29,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {157#true} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {157#true} is VALID [2018-11-23 13:03:29,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {157#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {159#(= |linear_search_#res| 1)} is VALID [2018-11-23 13:03:29,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {159#(= |linear_search_#res| 1)} assume true; {159#(= |linear_search_#res| 1)} is VALID [2018-11-23 13:03:29,921 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {159#(= |linear_search_#res| 1)} {157#true} #52#return; {160#(= |main_#t~ret4| 1)} is VALID [2018-11-23 13:03:29,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {160#(= |main_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {160#(= |main_#t~ret4| 1)} is VALID [2018-11-23 13:03:29,931 INFO L256 TraceCheckUtils]: 15: Hoare triple {160#(= |main_#t~ret4| 1)} call __VERIFIER_assert(#t~ret4); {161#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:29,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {161#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {162#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:29,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {162#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {158#false} is VALID [2018-11-23 13:03:29,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-23 13:03:29,939 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:03:29,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:29,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:03:29,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:03:29,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:29,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:03:30,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:30,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:30,013 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 13:03:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,671 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 13:03:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:30,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:03:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:03:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:03:30,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 13:03:30,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:30,754 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:03:30,754 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:03:30,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:03:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:03:30,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:30,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:30,770 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:30,770 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,772 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:03:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:03:30,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,773 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:30,773 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:03:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,776 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:03:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:03:30,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:30,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:03:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:03:30,780 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-11-23 13:03:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:30,780 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:03:30,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:03:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:03:30,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:30,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:30,782 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:30,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -742159986, now seen corresponding path program 1 times [2018-11-23 13:03:30,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:30,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:30,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:30,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:31,517 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-23 13:03:31,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2018-11-23 13:03:31,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {275#true} is VALID [2018-11-23 13:03:31,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2018-11-23 13:03:31,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #48#return; {275#true} is VALID [2018-11-23 13:03:31,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret5 := main(); {275#true} is VALID [2018-11-23 13:03:31,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {275#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {275#true} is VALID [2018-11-23 13:03:31,690 INFO L256 TraceCheckUtils]: 6: Hoare triple {275#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {275#true} is VALID [2018-11-23 13:03:31,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {275#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {277#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:31,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {277#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {278#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:31,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {279#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:31,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {279#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {279#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:31,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (= linear_search_~j~0 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {280#(and (or (<= (+ |linear_search_#in~n| ~SIZE~0 1) (* 4294967296 (div ~SIZE~0 4294967296))) (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:03:31,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#(and (or (<= (+ |linear_search_#in~n| ~SIZE~0 1) (* 4294967296 (div ~SIZE~0 4294967296))) (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} assume true; {280#(and (or (<= (+ |linear_search_#in~n| ~SIZE~0 1) (* 4294967296 (div ~SIZE~0 4294967296))) (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:03:31,710 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {280#(and (or (<= (+ |linear_search_#in~n| ~SIZE~0 1) (* 4294967296 (div ~SIZE~0 4294967296))) (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 8589934592 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} {275#true} #52#return; {276#false} is VALID [2018-11-23 13:03:31,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {276#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {276#false} is VALID [2018-11-23 13:03:31,711 INFO L256 TraceCheckUtils]: 15: Hoare triple {276#false} call __VERIFIER_assert(#t~ret4); {276#false} is VALID [2018-11-23 13:03:31,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {276#false} ~cond := #in~cond; {276#false} is VALID [2018-11-23 13:03:31,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {276#false} assume 0 == ~cond; {276#false} is VALID [2018-11-23 13:03:31,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {276#false} assume !false; {276#false} is VALID [2018-11-23 13:03:31,715 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:03:31,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:31,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:03:31,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:03:31,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:31,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:03:31,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:31,756 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 13:03:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:32,249 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 13:03:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:32,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 13:03:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 13:03:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 13:03:32,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 13:03:32,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:32,330 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:03:32,331 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:03:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:03:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-23 13:03:32,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:32,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 23 states. [2018-11-23 13:03:32,357 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 23 states. [2018-11-23 13:03:32,357 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 23 states. [2018-11-23 13:03:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:32,360 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 13:03:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 13:03:32,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:32,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:32,361 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 27 states. [2018-11-23 13:03:32,361 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 27 states. [2018-11-23 13:03:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:32,364 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 13:03:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 13:03:32,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:32,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:32,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:32,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:03:32,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2018-11-23 13:03:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:32,367 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:03:32,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:03:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:03:32,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:32,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:32,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:32,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1135186996, now seen corresponding path program 1 times [2018-11-23 13:03:32,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:32,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,918 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-11-23 13:03:33,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2018-11-23 13:03:33,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {424#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {424#true} is VALID [2018-11-23 13:03:33,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2018-11-23 13:03:33,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #48#return; {424#true} is VALID [2018-11-23 13:03:33,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret5 := main(); {424#true} is VALID [2018-11-23 13:03:33,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {424#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {426#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} is VALID [2018-11-23 13:03:33,082 INFO L256 TraceCheckUtils]: 6: Hoare triple {426#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {424#true} is VALID [2018-11-23 13:03:33,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {427#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:03:33,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {427#(= linear_search_~j~0 0)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {427#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:03:33,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {427#(= linear_search_~j~0 0)} assume !#t~short1; {427#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:03:33,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {427#(= linear_search_~j~0 0)} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {427#(= linear_search_~j~0 0)} is VALID [2018-11-23 13:03:33,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {427#(= linear_search_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {428#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:03:33,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} assume true; {428#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} is VALID [2018-11-23 13:03:33,092 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {428#(or (< 0 (div ~SIZE~0 4294967296)) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))))} {426#(and (<= (div ~SIZE~0 4294967296) 0) (<= 1 ~SIZE~0))} #52#return; {425#false} is VALID [2018-11-23 13:03:33,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {425#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {425#false} is VALID [2018-11-23 13:03:33,092 INFO L256 TraceCheckUtils]: 15: Hoare triple {425#false} call __VERIFIER_assert(#t~ret4); {425#false} is VALID [2018-11-23 13:03:33,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2018-11-23 13:03:33,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#false} assume 0 == ~cond; {425#false} is VALID [2018-11-23 13:03:33,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {425#false} assume !false; {425#false} is VALID [2018-11-23 13:03:33,094 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:03:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:03:33,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:03:33,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:33,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:03:33,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:33,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:03:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:03:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:33,156 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 13:03:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:33,416 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:03:33,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:33,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:03:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 13:03:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 13:03:33,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 13:03:33,491 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:03:33,493 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:03:33,493 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:03:33,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:03:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:03:33,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:33,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:03:33,556 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:03:33,556 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:03:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:33,559 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:03:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:03:33,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:33,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:33,560 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:03:33,560 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:03:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:33,563 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:03:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:03:33,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:33,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:33,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:33,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:03:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:03:33,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2018-11-23 13:03:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:33,566 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:03:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:03:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:03:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:03:33,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:33,567 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:33,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:33,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -161141641, now seen corresponding path program 1 times [2018-11-23 13:03:33,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:34,197 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-11-23 13:03:34,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {559#true} is VALID [2018-11-23 13:03:34,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {559#true} is VALID [2018-11-23 13:03:34,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {559#true} assume true; {559#true} is VALID [2018-11-23 13:03:34,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {559#true} {559#true} #48#return; {559#true} is VALID [2018-11-23 13:03:34,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {559#true} call #t~ret5 := main(); {559#true} is VALID [2018-11-23 13:03:34,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {559#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {559#true} is VALID [2018-11-23 13:03:34,411 INFO L256 TraceCheckUtils]: 6: Hoare triple {559#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {559#true} is VALID [2018-11-23 13:03:34,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {561#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:34,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {561#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {562#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:34,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {562#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {562#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:34,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {562#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {563#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:34,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {563#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {564#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:34,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {564#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {565#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:34,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {565#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {565#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:34,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {566#(and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))))} is VALID [2018-11-23 13:03:34,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))))} assume true; {566#(and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))))} is VALID [2018-11-23 13:03:34,433 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {566#(and (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 1)) (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))))} {559#true} #52#return; {560#false} is VALID [2018-11-23 13:03:34,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {560#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {560#false} is VALID [2018-11-23 13:03:34,434 INFO L256 TraceCheckUtils]: 18: Hoare triple {560#false} call __VERIFIER_assert(#t~ret4); {560#false} is VALID [2018-11-23 13:03:34,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {560#false} ~cond := #in~cond; {560#false} is VALID [2018-11-23 13:03:34,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {560#false} assume 0 == ~cond; {560#false} is VALID [2018-11-23 13:03:34,435 INFO L273 TraceCheckUtils]: 21: Hoare triple {560#false} assume !false; {560#false} is VALID [2018-11-23 13:03:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:34,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:34,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:34,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:34,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:35,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {559#true} is VALID [2018-11-23 13:03:35,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {559#true} is VALID [2018-11-23 13:03:35,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {559#true} assume true; {559#true} is VALID [2018-11-23 13:03:35,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {559#true} {559#true} #48#return; {559#true} is VALID [2018-11-23 13:03:35,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {559#true} call #t~ret5 := main(); {559#true} is VALID [2018-11-23 13:03:35,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {559#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {559#true} is VALID [2018-11-23 13:03:35,056 INFO L256 TraceCheckUtils]: 6: Hoare triple {559#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {559#true} is VALID [2018-11-23 13:03:35,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {591#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:35,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(and (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {595#(and (= |linear_search_#in~n| linear_search_~n) (or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) |linear_search_#t~short1|) (and (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:35,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {595#(and (= |linear_search_#in~n| linear_search_~n) (or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) |linear_search_#t~short1|) (and (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|))) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {599#(and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:35,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {599#(and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {603#(and (= linear_search_~j~0 1) (< 0 (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n))} is VALID [2018-11-23 13:03:35,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#(and (= linear_search_~j~0 1) (< 0 (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {607#(and (= linear_search_~j~0 1) (< 0 (mod |linear_search_#in~n| 4294967296)) (or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))))} is VALID [2018-11-23 13:03:35,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {607#(and (= linear_search_~j~0 1) (< 0 (mod |linear_search_#in~n| 4294967296)) (or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {611#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:03:35,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {611#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {611#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:03:35,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {611#(and (= linear_search_~j~0 1) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {618#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} is VALID [2018-11-23 13:03:35,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {618#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} assume true; {618#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} is VALID [2018-11-23 13:03:35,082 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {618#(and (< 1 (mod |linear_search_#in~n| 4294967296)) (<= (mod ~SIZE~0 4294967296) 1))} {559#true} #52#return; {560#false} is VALID [2018-11-23 13:03:35,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {560#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {560#false} is VALID [2018-11-23 13:03:35,082 INFO L256 TraceCheckUtils]: 18: Hoare triple {560#false} call __VERIFIER_assert(#t~ret4); {560#false} is VALID [2018-11-23 13:03:35,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {560#false} ~cond := #in~cond; {560#false} is VALID [2018-11-23 13:03:35,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {560#false} assume 0 == ~cond; {560#false} is VALID [2018-11-23 13:03:35,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {560#false} assume !false; {560#false} is VALID [2018-11-23 13:03:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:35,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:35,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-23 13:03:35,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:03:35,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:35,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:03:35,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:35,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:03:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:03:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:35,166 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 15 states. [2018-11-23 13:03:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,230 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 13:03:36,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:36,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:03:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-23 13:03:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-23 13:03:36,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2018-11-23 13:03:36,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:36,295 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:03:36,296 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:03:36,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:03:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:03:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-23 13:03:36,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:36,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2018-11-23 13:03:36,351 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2018-11-23 13:03:36,351 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2018-11-23 13:03:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,354 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:03:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 13:03:36,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,355 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2018-11-23 13:03:36,355 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2018-11-23 13:03:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:36,358 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:03:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 13:03:36,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:36,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:36,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:36,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:03:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 13:03:36,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 22 [2018-11-23 13:03:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:36,361 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 13:03:36,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:03:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:03:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:03:36,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:36,362 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:36,362 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:36,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -554168651, now seen corresponding path program 1 times [2018-11-23 13:03:36,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:36,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:37,992 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 30 [2018-11-23 13:03:38,543 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2018-11-23 13:03:38,860 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 22 [2018-11-23 13:03:38,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {797#true} is VALID [2018-11-23 13:03:38,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {797#true} is VALID [2018-11-23 13:03:38,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2018-11-23 13:03:38,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #48#return; {797#true} is VALID [2018-11-23 13:03:38,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {797#true} call #t~ret5 := main(); {797#true} is VALID [2018-11-23 13:03:38,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {797#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {799#(and (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|))} is VALID [2018-11-23 13:03:38,887 INFO L256 TraceCheckUtils]: 6: Hoare triple {799#(and (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {797#true} is VALID [2018-11-23 13:03:38,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {797#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {800#(and (or (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:38,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {800#(and (or (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {800#(and (or (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:38,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {800#(and (or (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {801#(and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (not (= 0 |linear_search_#in~a.offset|)) (not |linear_search_#t~short1|)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:38,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (not (= 0 |linear_search_#in~a.offset|)) (not |linear_search_#t~short1|)) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} is VALID [2018-11-23 13:03:38,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} is VALID [2018-11-23 13:03:38,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} assume !#t~short1; {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} is VALID [2018-11-23 13:03:38,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} is VALID [2018-11-23 13:03:38,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {802#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {803#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 0)))} is VALID [2018-11-23 13:03:38,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {803#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 0)))} assume true; {803#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 0)))} is VALID [2018-11-23 13:03:38,901 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {803#(or (not (= 0 |linear_search_#in~a.offset|)) (and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) 0) |linear_search_#in~q|)) (<= (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 0)))} {799#(and (or (not (= (* 17179869184 (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (+ (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|))) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|))} #52#return; {798#false} is VALID [2018-11-23 13:03:38,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {798#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {798#false} is VALID [2018-11-23 13:03:38,901 INFO L256 TraceCheckUtils]: 18: Hoare triple {798#false} call __VERIFIER_assert(#t~ret4); {798#false} is VALID [2018-11-23 13:03:38,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {798#false} ~cond := #in~cond; {798#false} is VALID [2018-11-23 13:03:38,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {798#false} assume 0 == ~cond; {798#false} is VALID [2018-11-23 13:03:38,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {798#false} assume !false; {798#false} is VALID [2018-11-23 13:03:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:38,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:38,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:38,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:38,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:39,033 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:39,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:39,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 13:03:39,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 13:03:39,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:39,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:39,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:39,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:245, output treesize:17 [2018-11-23 13:03:40,994 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-11-23 13:03:41,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {797#true} call ULTIMATE.init(); {797#true} is VALID [2018-11-23 13:03:41,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {797#true} is VALID [2018-11-23 13:03:41,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {797#true} assume true; {797#true} is VALID [2018-11-23 13:03:41,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {797#true} {797#true} #48#return; {797#true} is VALID [2018-11-23 13:03:41,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {797#true} call #t~ret5 := main(); {797#true} is VALID [2018-11-23 13:03:41,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {797#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {822#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} is VALID [2018-11-23 13:03:41,353 INFO L256 TraceCheckUtils]: 6: Hoare triple {822#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {826#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 13:03:41,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {826#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|))))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {830#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:41,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {830#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {834#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)))} is VALID [2018-11-23 13:03:41,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {834#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (= linear_search_~j~0 0)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {838#(or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))) (= linear_search_~j~0 0)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (= 3 (select (select |#memory_int| v_prenex_18) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_19)))) (not |linear_search_#t~short1|) (= linear_search_~j~0 0)))} is VALID [2018-11-23 13:03:41,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {838#(or (and (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))) (= linear_search_~j~0 0)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (= 3 (select (select |#memory_int| v_prenex_18) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_19)))) (not |linear_search_#t~short1|) (= linear_search_~j~0 0)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {842#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {842#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !#t~short1; {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#(and (= linear_search_~j~0 1) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {856#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {856#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} assume true; {856#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} is VALID [2018-11-23 13:03:41,375 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {856#(and (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (<= (mod ~SIZE~0 4294967296) 1) (exists ((v_prenex_4 Int) (v_prenex_5 Int)) (= 3 (select (select |#memory_int| v_prenex_5) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) v_prenex_4)))))} {822#(= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|)))} #52#return; {798#false} is VALID [2018-11-23 13:03:41,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {798#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {798#false} is VALID [2018-11-23 13:03:41,376 INFO L256 TraceCheckUtils]: 18: Hoare triple {798#false} call __VERIFIER_assert(#t~ret4); {798#false} is VALID [2018-11-23 13:03:41,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {798#false} ~cond := #in~cond; {798#false} is VALID [2018-11-23 13:03:41,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {798#false} assume 0 == ~cond; {798#false} is VALID [2018-11-23 13:03:41,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {798#false} assume !false; {798#false} is VALID [2018-11-23 13:03:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:41,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:41,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-23 13:03:41,405 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:03:41,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:41,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:03:41,471 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:03:41,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:03:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:03:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:41,473 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 15 states. [2018-11-23 13:03:41,871 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-11-23 13:03:42,040 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-23 13:03:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:42,724 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 13:03:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:42,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 13:03:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-23 13:03:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-23 13:03:42,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2018-11-23 13:03:42,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:42,857 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:03:42,857 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:03:42,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:03:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:03:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 13:03:42,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:42,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:42,954 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:42,954 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 13:03:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:42,957 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:03:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:03:42,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:42,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:42,958 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 13:03:42,958 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 13:03:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:42,960 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:03:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:03:42,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:42,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:42,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:42,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:03:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 13:03:42,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 22 [2018-11-23 13:03:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:42,964 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 13:03:42,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:03:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:03:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:03:42,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:42,965 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:42,965 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:42,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 238171374, now seen corresponding path program 2 times [2018-11-23 13:03:42,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:42,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:42,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:43,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 13:03:43,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1048#true} is VALID [2018-11-23 13:03:43,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:03:43,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #48#return; {1048#true} is VALID [2018-11-23 13:03:43,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret5 := main(); {1048#true} is VALID [2018-11-23 13:03:43,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1048#true} is VALID [2018-11-23 13:03:43,740 INFO L256 TraceCheckUtils]: 6: Hoare triple {1048#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {1048#true} is VALID [2018-11-23 13:03:43,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {1048#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1050#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:43,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {1050#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| linear_search_~n)) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1051#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:43,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {1051#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1051#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:43,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {1051#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:43,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:43,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:43,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {1052#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1053#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:43,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (<= linear_search_~n |linear_search_#in~n|)) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= |linear_search_#in~n| (+ (* 4294967296 (div linear_search_~n 4294967296)) 4294967295))) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1054#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:43,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {1054#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (not |linear_search_#t~short1|) (<= (+ |linear_search_#in~n| 1) 0)) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1055#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:03:43,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {1055#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1055#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:03:43,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {1055#(and (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0)) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1056#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:03:43,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} assume true; {1056#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:03:43,768 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1056#(and (or (<= (+ |linear_search_#in~n| 1) 0) (<= (+ ~SIZE~0 1) (+ |linear_search_#in~n| (* 4294967296 (div ~SIZE~0 4294967296))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} {1048#true} #52#return; {1049#false} is VALID [2018-11-23 13:03:43,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1049#false} is VALID [2018-11-23 13:03:43,769 INFO L256 TraceCheckUtils]: 21: Hoare triple {1049#false} call __VERIFIER_assert(#t~ret4); {1049#false} is VALID [2018-11-23 13:03:43,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 13:03:43,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 13:03:43,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 13:03:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:43,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:43,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:43,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:43,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:03:43,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:43,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:44,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 13:03:44,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1048#true} is VALID [2018-11-23 13:03:44,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:03:44,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #48#return; {1048#true} is VALID [2018-11-23 13:03:44,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret5 := main(); {1048#true} is VALID [2018-11-23 13:03:44,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1075#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 13:03:44,073 INFO L256 TraceCheckUtils]: 6: Hoare triple {1075#(= |main_~#a~0.offset| 0)} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {1048#true} is VALID [2018-11-23 13:03:44,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1048#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1082#(= |linear_search_#in~n| linear_search_~n)} is VALID [2018-11-23 13:03:44,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {1082#(= |linear_search_#in~n| linear_search_~n)} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1104#(or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-23 13:03:44,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {1104#(or (and (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not |linear_search_#t~short1|)) (and |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1108#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} is VALID [2018-11-23 13:03:44,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1108#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1108#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} is VALID [2018-11-23 13:03:44,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1115#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-23 13:03:44,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {1115#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} assume true; {1115#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-23 13:03:44,095 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1115#(exists ((linear_search_~j~0 Int)) (and (<= (mod ~SIZE~0 4294967296) (mod linear_search_~j~0 4294967296)) (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} {1075#(= |main_~#a~0.offset| 0)} #52#return; {1049#false} is VALID [2018-11-23 13:03:44,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1049#false} is VALID [2018-11-23 13:03:44,096 INFO L256 TraceCheckUtils]: 21: Hoare triple {1049#false} call __VERIFIER_assert(#t~ret4); {1049#false} is VALID [2018-11-23 13:03:44,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 13:03:44,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 13:03:44,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 13:03:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:44,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:44,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 13:03:44,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 13:03:44,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:44,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:03:44,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:44,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:03:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:03:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:03:44,178 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 14 states. [2018-11-23 13:03:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:45,650 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 13:03:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:03:45,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 13:03:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2018-11-23 13:03:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2018-11-23 13:03:45,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2018-11-23 13:03:45,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:45,763 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:03:45,764 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:03:45,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:03:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-11-23 13:03:45,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:45,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 26 states. [2018-11-23 13:03:45,956 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 26 states. [2018-11-23 13:03:45,956 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 26 states. [2018-11-23 13:03:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:45,958 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 13:03:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 13:03:45,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:45,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:45,960 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 36 states. [2018-11-23 13:03:45,960 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 36 states. [2018-11-23 13:03:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:45,962 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 13:03:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 13:03:45,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:45,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:45,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:45,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:03:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 13:03:45,965 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2018-11-23 13:03:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:45,965 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 13:03:45,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:03:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:03:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:03:45,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:45,967 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:45,967 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:45,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -154855636, now seen corresponding path program 2 times [2018-11-23 13:03:45,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:45,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:45,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:49,357 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 190 DAG size of output: 34 [2018-11-23 13:03:49,713 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2018-11-23 13:03:49,919 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-11-23 13:03:50,219 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-11-23 13:03:51,009 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-11-23 13:03:51,191 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-11-23 13:03:54,178 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 121 DAG size of output: 53 [2018-11-23 13:03:54,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 13:03:54,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1333#true} is VALID [2018-11-23 13:03:54,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 13:03:54,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #48#return; {1333#true} is VALID [2018-11-23 13:03:54,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret5 := main(); {1333#true} is VALID [2018-11-23 13:03:54,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1335#(or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (and (or (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|)))} is VALID [2018-11-23 13:03:54,201 INFO L256 TraceCheckUtils]: 6: Hoare triple {1335#(or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (and (or (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|)))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {1333#true} is VALID [2018-11-23 13:03:54,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:54,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:54,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:54,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {1336#(and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (not (= linear_search_~a.offset 0)) (and (= linear_search_~a.base |linear_search_#in~a.base|) (= linear_search_~q |linear_search_#in~q|))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= |linear_search_#in~n| linear_search_~n) (<= linear_search_~n |linear_search_#in~n|) (= linear_search_~j~0 0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1337#(and (or (not (= linear_search_~a.offset 0)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (= linear_search_~a.base |linear_search_#in~a.base|) (<= (+ |linear_search_#in~n| (* 2 (div (+ (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ (* 2 linear_search_~j~0) (- 1)))) 2)) (+ (- linear_search_~j~0) 2)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (= linear_search_~q |linear_search_#in~q|) (<= (+ (* 2 linear_search_~j~0) linear_search_~n) (+ |linear_search_#in~n| 2)))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:54,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {1337#(and (or (not (= linear_search_~a.offset 0)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (= linear_search_~a.base |linear_search_#in~a.base|) (<= (+ |linear_search_#in~n| (* 2 (div (+ (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ (* 2 linear_search_~j~0) (- 1)))) 2)) (+ (- linear_search_~j~0) 2)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (= linear_search_~q |linear_search_#in~q|) (<= (+ (* 2 linear_search_~j~0) linear_search_~n) (+ |linear_search_#in~n| 2)))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1338#(and (or (and (or (not (= linear_search_~a.offset 0)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (= linear_search_~a.base |linear_search_#in~a.base|) (<= (+ |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n linear_search_~j~0)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (<= (+ (* 2 linear_search_~j~0) (* 4294967296 (div linear_search_~n 4294967296))) (+ |linear_search_#in~n| 1)) (= linear_search_~q |linear_search_#in~q|))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n))) (not |linear_search_#t~short1|)) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:54,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {1338#(and (or (and (or (not (= linear_search_~a.offset 0)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (= linear_search_~a.base |linear_search_#in~a.base|) (<= (+ |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n linear_search_~j~0)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (<= (+ (* 2 linear_search_~j~0) (* 4294967296 (div linear_search_~n 4294967296))) (+ |linear_search_#in~n| 1)) (= linear_search_~q |linear_search_#in~q|))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (or (= linear_search_~a.offset 0) (= linear_search_~a.offset |linear_search_#in~a.offset|)) (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n))) (not |linear_search_#t~short1|)) (<= linear_search_~j~0 1) (<= 1 linear_search_~j~0))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1339#(and (or (not (= 0 |linear_search_#in~a.offset|)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (<= (+ |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n linear_search_~j~0)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (or (<= (+ (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)) 5) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ linear_search_~j~0 (- 1)))) 2)) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 2 linear_search_~n))) (not (= |linear_search_#in~q| (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 linear_search_~j~0) (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* (- 4) (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)))))) (not |linear_search_#t~short1|)) (<= (+ (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)) 4) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ linear_search_~j~0 (- 1)))) 2)) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 2 linear_search_~n))))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (<= linear_search_~j~0 1) (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n)) (<= 1 linear_search_~j~0))} is VALID [2018-11-23 13:03:54,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {1339#(and (or (not (= 0 |linear_search_#in~a.offset|)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (<= (+ |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n linear_search_~j~0)) 2)) 1) (+ linear_search_~j~0 linear_search_~n)) (or (<= (+ (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)) 5) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ linear_search_~j~0 (- 1)))) 2)) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 2 linear_search_~n))) (not (= |linear_search_#in~q| (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 linear_search_~j~0) (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* (- 4) (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)))))) (not |linear_search_#t~short1|)) (<= (+ (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (+ (* 4294967296 (div linear_search_~n 4294967296)) (* 2 linear_search_~j~0))) 2)) 4) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ linear_search_~n (+ linear_search_~j~0 (- 1)))) 2)) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 2 linear_search_~n))))) (or (< 0 (+ (div linear_search_~n 4294967296) 1)) (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 1))))) (<= linear_search_~j~0 1) (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n)) (<= 1 linear_search_~j~0))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1340#(and (or (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n) (not (= 0 |linear_search_#in~a.offset|)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2)))) |linear_search_#in~q|)) (<= (+ (* 4 linear_search_~j~0) (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2)) 1) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) linear_search_~n)) 2)) (* 2 linear_search_~n)))) (<= (+ (* 4 linear_search_~j~0) (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2))) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) linear_search_~n)) 2)) (* 2 linear_search_~n))) (<= (+ linear_search_~j~0 |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) (+ linear_search_~n 1))) 2))) linear_search_~n))) (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 2)) (< 0 (+ (div linear_search_~n 4294967296) 1))))) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (< (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296))) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n 1)))} is VALID [2018-11-23 13:03:54,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1340#(and (or (<= (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296)) 1) linear_search_~n) (not (= 0 |linear_search_#in~a.offset|)) (and (or (<= (+ (div linear_search_~n 4294967296) 1) 0) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2)))) |linear_search_#in~q|)) (<= (+ (* 4 linear_search_~j~0) (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2)) 1) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) linear_search_~n)) 2)) (* 2 linear_search_~n)))) (<= (+ (* 4 linear_search_~j~0) (* 8589934592 (div linear_search_~n 4294967296)) (* 8 (div (+ (- |linear_search_#in~n|) (* 4294967296 (div linear_search_~n 4294967296))) 2))) (+ (* 4 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) linear_search_~n)) 2)) (* 2 linear_search_~n))) (<= (+ linear_search_~j~0 |linear_search_#in~n| (* 2 (div (+ (- |linear_search_#in~n|) (+ (- linear_search_~j~0) (+ linear_search_~n 1))) 2))) linear_search_~n))) (or (<= (+ linear_search_~j~0 |linear_search_#in~n|) (+ linear_search_~n 2)) (< 0 (+ (div linear_search_~n 4294967296) 1))))) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (< (+ linear_search_~j~0 (* 4294967296 (div linear_search_~n 4294967296))) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) linear_search_~n 1)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1341#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) |linear_search_#t~short1|) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:03:54,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1341#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) |linear_search_#t~short1|) (<= linear_search_~j~0 2) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short1; {1342#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2))))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:03:54,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {1342#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2))))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1342#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2))))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} is VALID [2018-11-23 13:03:54,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {1342#(and (or (not (= 0 |linear_search_#in~a.offset|)) (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n| 4294967294) 0) (and (<= (+ (* 4294967296 (div linear_search_~j~0 4294967296)) (* 2 (div (+ (- |linear_search_#in~n|) (+ (* (- 4294967296) (div linear_search_~j~0 4294967296)) 1)) 2)) |linear_search_#in~n|) 0) (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (- (* 4 (div (- |linear_search_#in~n|) 2)))) |linear_search_#in~q|)) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2)) 1) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2)))) (<= (+ (* 2 linear_search_~j~0) (* 8589934592 (div linear_search_~j~0 4294967296)) (* 8 (div (- |linear_search_#in~n|) 2))) (* 4 (div (+ (- |linear_search_#in~n|) (* (- 4294967296) (div linear_search_~j~0 4294967296))) 2))))) (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (<= linear_search_~j~0 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1343#(and (or (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)) 2) (* 2 ~SIZE~0)) (not (= 0 |linear_search_#in~a.offset|)) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- (* 4 (div ~SIZE~0 2))) (- (* (- 4) ~SIZE~0)) (- (* 8589934592 (div ~SIZE~0 4294967296))))) |linear_search_#in~q|)) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0)) (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:03:54,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {1343#(and (or (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)) 2) (* 2 ~SIZE~0)) (not (= 0 |linear_search_#in~a.offset|)) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- (* 4 (div ~SIZE~0 2))) (- (* (- 4) ~SIZE~0)) (- (* 8589934592 (div ~SIZE~0 4294967296))))) |linear_search_#in~q|)) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0)) (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} assume true; {1343#(and (or (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)) 2) (* 2 ~SIZE~0)) (not (= 0 |linear_search_#in~a.offset|)) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- (* 4 (div ~SIZE~0 2))) (- (* (- 4) ~SIZE~0)) (- (* 8589934592 (div ~SIZE~0 4294967296))))) |linear_search_#in~q|)) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0)) (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} is VALID [2018-11-23 13:03:54,256 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1343#(and (or (<= (+ (* 2 ~SIZE~0) 1) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)) 2) (* 2 ~SIZE~0)) (not (= 0 |linear_search_#in~a.offset|)) (and (or (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- (* 4 (div ~SIZE~0 2))) (- (* (- 4) ~SIZE~0)) (- (* 8589934592 (div ~SIZE~0 4294967296))))) |linear_search_#in~q|)) (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0)) (or (<= (* 2 ~SIZE~0) (+ |linear_search_#in~n| (* 2 (div ~SIZE~0 2)) (* 4294967296 (div ~SIZE~0 4294967296)))) (<= ~SIZE~0 (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)))))) (<= ~SIZE~0 (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2)))} {1335#(or (<= (+ (* 4294967296 (div ~SIZE~0 4294967296)) 2147483648) ~SIZE~0) (and (or (< (+ (div ~SIZE~0 2) (* 2147483648 (div ~SIZE~0 4294967296)) (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) ~SIZE~0) (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* (- 17179869184) (div (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2) 4294967296)) (* 4 (div (+ ~SIZE~0 (* (- 4294967296) (div ~SIZE~0 4294967296))) 2)) |main_~#a~0.offset|)))) (= 0 |main_~#a~0.offset|)))} #52#return; {1334#false} is VALID [2018-11-23 13:03:54,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1334#false} is VALID [2018-11-23 13:03:54,256 INFO L256 TraceCheckUtils]: 21: Hoare triple {1334#false} call __VERIFIER_assert(#t~ret4); {1334#false} is VALID [2018-11-23 13:03:54,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2018-11-23 13:03:54,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2018-11-23 13:03:54,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 13:03:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:54,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:54,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:54,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:54,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:54,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:54,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:54,654 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:03:54,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:54,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 13:03:54,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 13:03:54,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:54,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:54,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:54,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:263, output treesize:21 [2018-11-23 13:03:55,305 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-23 13:03:55,623 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 13:03:56,362 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-11-23 13:03:58,686 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 13:03:59,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2018-11-23 13:03:59,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1333#true} is VALID [2018-11-23 13:03:59,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2018-11-23 13:03:59,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #48#return; {1333#true} is VALID [2018-11-23 13:03:59,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret5 := main(); {1333#true} is VALID [2018-11-23 13:03:59,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {1333#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1362#(and (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 13:03:59,013 INFO L256 TraceCheckUtils]: 6: Hoare triple {1362#(and (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {1366#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3))} is VALID [2018-11-23 13:03:59,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {1366#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1370#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0))} is VALID [2018-11-23 13:03:59,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {1370#(and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1374#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (= linear_search_~j~0 0)))} is VALID [2018-11-23 13:03:59,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1| (= linear_search_~j~0 0)))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1378#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (= (select (select |#memory_int| linear_search_~a.base) (+ linear_search_~a.offset (* 4 (mod linear_search_~j~0 4294967296)))) linear_search_~q) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) (not (= (select (select |#memory_int| linear_search_~a.base) (+ linear_search_~a.offset (* 4 (mod linear_search_~j~0 4294967296)))) linear_search_~q)) |linear_search_#t~short1| (= linear_search_~j~0 0)))} is VALID [2018-11-23 13:03:59,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {1378#(or (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (= (select (select |#memory_int| linear_search_~a.base) (+ linear_search_~a.offset (* 4 (mod linear_search_~j~0 4294967296)))) linear_search_~q) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q) (= linear_search_~j~0 0)) (and (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) (not (= (select (select |#memory_int| linear_search_~a.base) (+ linear_search_~a.offset (* 4 (mod linear_search_~j~0 4294967296)))) linear_search_~q)) |linear_search_#t~short1| (= linear_search_~j~0 0)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1382#(and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (= |linear_search_#in~n| linear_search_~n) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q))} is VALID [2018-11-23 13:03:59,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {1382#(and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (= |linear_search_#in~n| linear_search_~n) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1386#(or (and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (= |linear_search_#in~n| linear_search_~n) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q)) (and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1|))} is VALID [2018-11-23 13:03:59,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {1386#(or (and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (<= (mod linear_search_~n 4294967296) (mod linear_search_~j~0 4294967296)) (= |linear_search_#in~n| linear_search_~n) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (not |linear_search_#t~short1|) (= |linear_search_#in~q| linear_search_~q)) (and (= linear_search_~j~0 1) (= |linear_search_#in~a.base| linear_search_~a.base) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) linear_search_~a.offset)) linear_search_~q)) (= |linear_search_#in~n| linear_search_~n) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~q| linear_search_~q) |linear_search_#t~short1|))} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1390#(or (and (= linear_search_~j~0 1) (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1|) (and (= linear_search_~j~0 1) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_34 Int)) (= (select (select |#memory_int| v_prenex_34) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)))) (not |linear_search_#t~short1|)))} is VALID [2018-11-23 13:03:59,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {1390#(or (and (= linear_search_~j~0 1) (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1|) (and (= linear_search_~j~0 1) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) |linear_search_#in~q|) (< (mod linear_search_~j~0 4294967296) (mod linear_search_~n 4294967296)) (exists ((v_prenex_34 Int)) (= (select (select |#memory_int| v_prenex_34) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod linear_search_~j~0 4294967296)))) (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)))) (not |linear_search_#t~short1|)))} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1394#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} is VALID [2018-11-23 13:03:59,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {1394#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (= |linear_search_#in~n| linear_search_~n) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod linear_search_~n 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1398#(or (and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|))) (and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} is VALID [2018-11-23 13:03:59,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {1398#(or (and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not |linear_search_#t~short1|) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|))) (and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)) |linear_search_#t~short1| (< (mod linear_search_~j~0 4294967296) (mod |linear_search_#in~n| 4294967296))))} assume !#t~short1; {1402#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} is VALID [2018-11-23 13:03:59,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {1402#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1402#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} is VALID [2018-11-23 13:03:59,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {1402#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (= linear_search_~j~0 2) (< (mod (+ linear_search_~j~0 4294967295) 4294967296) (mod |linear_search_#in~n| 4294967296)) (<= (mod |linear_search_#in~n| 4294967296) (mod linear_search_~j~0 4294967296)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* 4 (mod (+ linear_search_~j~0 4294967295) 4294967296)) |linear_search_#in~a.offset|)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod (+ linear_search_~j~0 4294967294) 4294967296)))) |linear_search_#in~q|)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1409#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (<= (mod |linear_search_#in~n| 4294967296) 2) (<= (mod ~SIZE~0 4294967296) 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| 4)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (< 1 (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:03:59,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (<= (mod |linear_search_#in~n| 4294967296) 2) (<= (mod ~SIZE~0 4294967296) 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| 4)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (< 1 (mod |linear_search_#in~n| 4294967296)))} assume true; {1409#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (<= (mod |linear_search_#in~n| 4294967296) 2) (<= (mod ~SIZE~0 4294967296) 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| 4)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (< 1 (mod |linear_search_#in~n| 4294967296)))} is VALID [2018-11-23 13:03:59,050 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1409#(and (exists ((v_prenex_29 Int)) (= (select (select |#memory_int| v_prenex_29) (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296))) 3)) (<= (mod |linear_search_#in~n| 4294967296) 2) (<= (mod ~SIZE~0 4294967296) 2) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| 4)) |linear_search_#in~q|)) (not (= (select (select |#memory_int| |linear_search_#in~a.base|) |linear_search_#in~a.offset|) |linear_search_#in~q|)) (< 1 (mod |linear_search_#in~n| 4294967296)))} {1362#(and (= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296)) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #52#return; {1334#false} is VALID [2018-11-23 13:03:59,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1334#false} is VALID [2018-11-23 13:03:59,051 INFO L256 TraceCheckUtils]: 21: Hoare triple {1334#false} call __VERIFIER_assert(#t~ret4); {1334#false} is VALID [2018-11-23 13:03:59,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2018-11-23 13:03:59,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2018-11-23 13:03:59,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2018-11-23 13:03:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:59,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:59,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-11-23 13:03:59,080 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-11-23 13:03:59,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:59,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:03:59,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:59,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:03:59,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:03:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=431, Unknown=1, NotChecked=0, Total=506 [2018-11-23 13:03:59,242 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 23 states. [2018-11-23 13:04:00,645 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-11-23 13:04:01,046 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2018-11-23 13:04:01,456 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 107 [2018-11-23 13:04:02,275 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-23 13:04:02,562 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-23 13:04:03,587 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-11-23 13:04:07,517 WARN L180 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 137 [2018-11-23 13:04:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:07,981 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 13:04:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:04:07,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-11-23 13:04:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:04:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 67 transitions. [2018-11-23 13:04:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:04:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 67 transitions. [2018-11-23 13:04:07,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 67 transitions. [2018-11-23 13:04:08,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:08,247 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:04:08,247 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:04:08,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=189, Invalid=999, Unknown=2, NotChecked=0, Total=1190 [2018-11-23 13:04:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:04:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-23 13:04:08,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:08,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2018-11-23 13:04:08,398 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2018-11-23 13:04:08,398 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2018-11-23 13:04:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:08,402 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 13:04:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 13:04:08,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:08,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:08,403 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2018-11-23 13:04:08,403 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2018-11-23 13:04:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:08,404 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 13:04:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 13:04:08,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:08,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:08,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:08,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:04:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 13:04:08,407 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2018-11-23 13:04:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:08,407 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 13:04:08,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:04:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 13:04:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:04:08,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:08,408 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:08,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:08,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash -741661650, now seen corresponding path program 3 times [2018-11-23 13:04:08,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:08,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:08,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:08,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2018-11-23 13:04:08,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {1660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1660#true} is VALID [2018-11-23 13:04:08,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1660#true} {1660#true} #48#return; {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {1660#true} call #t~ret5 := main(); {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {1660#true} ~SIZE~0 := 1 + (if #t~nondet3 % 4294967296 < 0 && 0 != #t~nondet3 % 4294967296 % 8 then 1 + #t~nondet3 % 4294967296 / 8 else #t~nondet3 % 4294967296 / 8);havoc #t~nondet3;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));call write~int(3, ~#a~0.base, ~#a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L256 TraceCheckUtils]: 6: Hoare triple {1660#true} call #t~ret4 := linear_search(~#a~0.base, ~#a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {1660#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1660#true} is VALID [2018-11-23 13:04:08,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {1660#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1660#true} is VALID [2018-11-23 13:04:08,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {1660#true} assume #t~short1;call #t~mem0 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short1 := #t~mem0 != ~q; {1660#true} is VALID [2018-11-23 13:04:08,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {1660#true} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1660#true} is VALID [2018-11-23 13:04:08,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {1660#true} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1660#true} is VALID [2018-11-23 13:04:08,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {1660#true} assume !#t~short1; {1662#(not |linear_search_#t~short1|)} is VALID [2018-11-23 13:04:08,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {1662#(not |linear_search_#t~short1|)} assume !!#t~short1;havoc #t~short1;havoc #t~mem0;#t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {1661#false} is VALID [2018-11-23 13:04:08,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {1661#false} #t~short1 := ~j~0 % 4294967296 < ~n % 4294967296; {1661#false} is VALID [2018-11-23 13:04:08,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {1661#false} assume !#t~short1; {1661#false} is VALID [2018-11-23 13:04:08,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {1661#false} assume !#t~short1;havoc #t~short1;havoc #t~mem0; {1661#false} is VALID [2018-11-23 13:04:08,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {1661#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1661#false} is VALID [2018-11-23 13:04:08,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {1661#false} assume true; {1661#false} is VALID [2018-11-23 13:04:08,617 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1661#false} {1660#true} #52#return; {1661#false} is VALID [2018-11-23 13:04:08,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {1661#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1661#false} is VALID [2018-11-23 13:04:08,617 INFO L256 TraceCheckUtils]: 21: Hoare triple {1661#false} call __VERIFIER_assert(#t~ret4); {1661#false} is VALID [2018-11-23 13:04:08,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1661#false} ~cond := #in~cond; {1661#false} is VALID [2018-11-23 13:04:08,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1661#false} assume 0 == ~cond; {1661#false} is VALID [2018-11-23 13:04:08,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2018-11-23 13:04:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:04:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:08,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 13:04:08,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:08,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:08,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:08,923 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 3 states. [2018-11-23 13:04:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:09,109 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 13:04:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:09,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 13:04:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 13:04:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-23 13:04:09,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2018-11-23 13:04:09,195 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:04:09,196 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:04:09,196 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:04:09,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:04:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:04:09,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:09,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:09,253 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:09,253 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:09,254 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:09,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:09,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:09,255 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:09,256 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:09,257 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:09,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:09,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:09,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:09,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:04:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:04:09,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-11-23 13:04:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:09,259 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:04:09,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:09,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:09,260 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:09,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1280235691, now seen corresponding path program 4 times [2018-11-23 13:04:09,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:09,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:09,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:09,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:21,129 WARN L180 SmtUtils]: Spent 10.45 s on a formula simplification. DAG size of input: 220 DAG size of output: 33 [2018-11-23 13:04:27,367 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-11-23 13:04:32,210 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-11-23 13:04:36,856 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-11-23 13:04:39,058 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-23 13:04:45,433 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-11-23 13:04:45,445 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:04:45,448 INFO L168 Benchmark]: Toolchain (without parser) took 78125.65 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -552.5 MB). Peak memory consumption was 516.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:45,449 INFO L168 Benchmark]: CDTParser took 0.25 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:04:45,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.70 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:04:45,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.56 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:04:45,450 INFO L168 Benchmark]: Boogie Preprocessor took 32.09 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:04:45,451 INFO L168 Benchmark]: RCFGBuilder took 731.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:45,451 INFO L168 Benchmark]: TraceAbstraction took 76974.58 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 213.8 MB). Peak memory consumption was 546.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:45,455 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.25 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 358.70 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.56 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 32.09 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 731.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76974.58 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 213.8 MB). Peak memory consumption was 546.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...