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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:14:29,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:14:29,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:14:29,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:14:29,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:14:29,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:14:29,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:14:29,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:14:29,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:14:29,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:14:29,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:14:29,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:14:29,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:14:29,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:14:29,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:14:29,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:14:29,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:14:29,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:14:29,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:14:29,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:14:29,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:14:29,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:14:29,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:14:29,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:14:29,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:14:29,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:14:29,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:14:29,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:14:29,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:14:29,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:14:29,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:14:29,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:14:29,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:14:29,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:14:29,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:14:29,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:14:29,239 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:14:29,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:14:29,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:14:29,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:14:29,261 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:14:29,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:14:29,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:14:29,262 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:14:29,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:14:29,264 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:14:29,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:14:29,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:14:29,265 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:14:29,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:14:29,265 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:14:29,265 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:14:29,265 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:14:29,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:14:29,266 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:14:29,266 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:14:29,266 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:14:29,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:14:29,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:14:29,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:14:29,267 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:14:29,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:14:29,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:14:29,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:14:29,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:14:29,269 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:14:29,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:14:29,270 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:14:29,270 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:14:29,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:14:29,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:14:29,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:14:29,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:14:29,362 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:14:29,363 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:14:29,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c [2018-11-14 18:14:29,437 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063243224/42b33277b44c4108afdd7a7a77357893/FLAG24db20965 [2018-11-14 18:14:29,863 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:14:29,864 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c [2018-11-14 18:14:29,870 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063243224/42b33277b44c4108afdd7a7a77357893/FLAG24db20965 [2018-11-14 18:14:29,885 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063243224/42b33277b44c4108afdd7a7a77357893 [2018-11-14 18:14:29,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:14:29,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:14:29,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:29,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:14:29,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:14:29,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:29" (1/1) ... [2018-11-14 18:14:29,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c292c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:29, skipping insertion in model container [2018-11-14 18:14:29,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:29" (1/1) ... [2018-11-14 18:14:29,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:14:29,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:14:30,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:30,249 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:14:30,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:30,302 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:14:30,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30 WrapperNode [2018-11-14 18:14:30,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:30,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:14:30,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:14:30,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:14:30,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (1/1) ... [2018-11-14 18:14:30,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:14:30,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:14:30,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:14:30,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:14:30,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (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-14 18:14:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:14:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:14:30,485 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-14 18:14:30,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:14:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:14:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:14:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-14 18:14:30,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:14:30,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:14:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:14:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:14:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:14:30,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:14:30,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:14:30,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:14:30,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:14:30,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:14:31,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:14:31,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:31 BoogieIcfgContainer [2018-11-14 18:14:31,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:14:31,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:14:31,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:14:31,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:14:31,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:14:29" (1/3) ... [2018-11-14 18:14:31,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ced2a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:31, skipping insertion in model container [2018-11-14 18:14:31,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:30" (2/3) ... [2018-11-14 18:14:31,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ced2a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:31, skipping insertion in model container [2018-11-14 18:14:31,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:31" (3/3) ... [2018-11-14 18:14:31,163 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-11-14 18:14:31,173 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:14:31,181 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:14:31,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:14:31,233 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:14:31,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:14:31,234 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:14:31,234 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:14:31,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:14:31,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:14:31,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:14:31,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:14:31,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:14:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-14 18:14:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:14:31,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:31,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:31,265 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:31,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1246131778, now seen corresponding path program 1 times [2018-11-14 18:14:31,275 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:31,275 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:31,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:31,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-14 18:14:31,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-14 18:14:31,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-14 18:14:31,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #61#return; {29#true} is VALID [2018-11-14 18:14:31,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret13 := main(); {29#true} is VALID [2018-11-14 18:14:31,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {29#true} is VALID [2018-11-14 18:14:31,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-14 18:14:31,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {30#false} is VALID [2018-11-14 18:14:31,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {30#false} is VALID [2018-11-14 18:14:31,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !true; {30#false} is VALID [2018-11-14 18:14:31,528 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {30#false} is VALID [2018-11-14 18:14:31,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {30#false} is VALID [2018-11-14 18:14:31,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume true; {30#false} is VALID [2018-11-14 18:14:31,529 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {30#false} {30#false} #59#return; {30#false} is VALID [2018-11-14 18:14:31,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {30#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {30#false} is VALID [2018-11-14 18:14:31,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-14 18:14:31,533 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-14 18:14:31,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:31,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:31,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:14:31,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:14:31,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:31,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:14:31,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:14:31,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:14:31,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:14:31,683 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-14 18:14:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:31,973 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-14 18:14:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:14:31,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:14:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-14 18:14:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-14 18:14:31,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2018-11-14 18:14:32,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:32,303 INFO L225 Difference]: With dead ends: 43 [2018-11-14 18:14:32,304 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 18:14:32,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-14 18:14:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 18:14:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 18:14:32,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:32,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:32,383 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:32,383 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:32,387 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-14 18:14:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 18:14:32,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:32,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:32,389 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:32,389 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:32,393 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-14 18:14:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 18:14:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:32,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:32,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:32,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:14:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-14 18:14:32,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-14 18:14:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:32,400 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-14 18:14:32,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:14:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 18:14:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:14:32,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:32,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:32,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:32,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 345065564, now seen corresponding path program 1 times [2018-11-14 18:14:32,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:32,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:32,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:32,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:32,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-14 18:14:32,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {206#true} is VALID [2018-11-14 18:14:32,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-14 18:14:32,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2018-11-14 18:14:32,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret13 := main(); {206#true} is VALID [2018-11-14 18:14:32,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {226#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:32,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#(= main_~j~0 (_ bv0 32))} assume true; {226#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:32,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(= main_~j~0 (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {207#false} is VALID [2018-11-14 18:14:32,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {207#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {207#false} is VALID [2018-11-14 18:14:32,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {207#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {207#false} is VALID [2018-11-14 18:14:32,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#false} assume true; {207#false} is VALID [2018-11-14 18:14:32,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {207#false} is VALID [2018-11-14 18:14:32,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {207#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {207#false} is VALID [2018-11-14 18:14:32,655 INFO L256 TraceCheckUtils]: 13: Hoare triple {207#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {207#false} is VALID [2018-11-14 18:14:32,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {207#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {207#false} is VALID [2018-11-14 18:14:32,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#false} assume true; {207#false} is VALID [2018-11-14 18:14:32,656 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {207#false} {207#false} #59#return; {207#false} is VALID [2018-11-14 18:14:32,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {207#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {207#false} is VALID [2018-11-14 18:14:32,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-14 18:14:32,658 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-14 18:14:32,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:14:32,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:14:32,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:32,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:14:32,772 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-14 18:14:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:14:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:14:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:14:32,774 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-11-14 18:14:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:33,346 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 18:14:33,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:14:33,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:14:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-14 18:14:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-14 18:14:33,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-14 18:14:33,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:33,493 INFO L225 Difference]: With dead ends: 36 [2018-11-14 18:14:33,494 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:14:33,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-14 18:14:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:14:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-14 18:14:33,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:33,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-14 18:14:33,511 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-14 18:14:33,511 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-14 18:14:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:33,514 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 18:14:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 18:14:33,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:33,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:33,515 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-14 18:14:33,515 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-14 18:14:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:33,518 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 18:14:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 18:14:33,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:33,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:33,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:33,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:14:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-14 18:14:33,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2018-11-14 18:14:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:33,522 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-14 18:14:33,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:14:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-14 18:14:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:14:33,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:33,523 INFO L375 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-14 18:14:33,524 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:33,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash 165517468, now seen corresponding path program 1 times [2018-11-14 18:14:33,525 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:33,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:33,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2018-11-14 18:14:33,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {396#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {396#true} is VALID [2018-11-14 18:14:33,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2018-11-14 18:14:33,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #61#return; {396#true} is VALID [2018-11-14 18:14:33,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret13 := main(); {396#true} is VALID [2018-11-14 18:14:33,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {396#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {416#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:33,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {416#(= main_~j~0 (_ bv0 32))} assume true; {416#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:33,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {416#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {416#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:33,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(= main_~j~0 (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {426#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:33,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {426#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:33,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {397#false} is VALID [2018-11-14 18:14:33,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {397#false} is VALID [2018-11-14 18:14:33,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {397#false} is VALID [2018-11-14 18:14:33,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {397#false} assume true; {397#false} is VALID [2018-11-14 18:14:33,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {397#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {397#false} is VALID [2018-11-14 18:14:33,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {397#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {397#false} is VALID [2018-11-14 18:14:33,802 INFO L256 TraceCheckUtils]: 16: Hoare triple {397#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {397#false} is VALID [2018-11-14 18:14:33,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {397#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {397#false} is VALID [2018-11-14 18:14:33,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {397#false} assume true; {397#false} is VALID [2018-11-14 18:14:33,803 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {397#false} {397#false} #59#return; {397#false} is VALID [2018-11-14 18:14:33,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {397#false} is VALID [2018-11-14 18:14:33,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#false} assume !false; {397#false} is VALID [2018-11-14 18:14:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:14:33,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:14:34,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#false} assume !false; {397#false} is VALID [2018-11-14 18:14:34,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {397#false} is VALID [2018-11-14 18:14:34,006 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {396#true} {397#false} #59#return; {397#false} is VALID [2018-11-14 18:14:34,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {396#true} assume true; {396#true} is VALID [2018-11-14 18:14:34,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {396#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {396#true} is VALID [2018-11-14 18:14:34,007 INFO L256 TraceCheckUtils]: 16: Hoare triple {397#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {396#true} is VALID [2018-11-14 18:14:34,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {397#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {397#false} is VALID [2018-11-14 18:14:34,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {397#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {397#false} is VALID [2018-11-14 18:14:34,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {397#false} assume true; {397#false} is VALID [2018-11-14 18:14:34,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {397#false} is VALID [2018-11-14 18:14:34,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {397#false} is VALID [2018-11-14 18:14:34,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {397#false} is VALID [2018-11-14 18:14:34,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {499#(bvslt main_~j~0 (_ bv10 32))} assume true; {499#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-14 18:14:34,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {499#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-14 18:14:34,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:34,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume true; {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:34,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {396#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {506#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:34,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret13 := main(); {396#true} is VALID [2018-11-14 18:14:34,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #61#return; {396#true} is VALID [2018-11-14 18:14:34,023 INFO L273 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2018-11-14 18:14:34,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {396#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {396#true} is VALID [2018-11-14 18:14:34,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2018-11-14 18:14:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:14:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:14:34,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:14:34,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:14:34,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:34,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:14:34,113 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-14 18:14:34,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:14:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:14:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:14:34,114 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-14 18:14:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:34,673 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 18:14:34,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:14:34,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:14:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:14:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-14 18:14:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:14:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-14 18:14:34,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2018-11-14 18:14:34,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:34,775 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:14:34,775 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:14:34,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:14:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:14:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 18:14:34,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:34,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 18:14:34,788 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:14:34,788 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:14:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:34,791 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 18:14:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:14:34,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:34,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:34,792 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:14:34,792 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:14:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:34,795 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 18:14:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:14:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:34,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:34,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:34,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:14:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-14 18:14:34,799 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2018-11-14 18:14:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-14 18:14:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:14:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:14:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:14:34,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:34,801 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:34,801 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:34,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -472549284, now seen corresponding path program 2 times [2018-11-14 18:14:34,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:34,824 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:14:34,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:14:34,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:14:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:34,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:35,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 36 treesize of output 30 [2018-11-14 18:14:35,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 9 [2018-11-14 18:14:35,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:35,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:35,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:35,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:12 [2018-11-14 18:14:35,815 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:35,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 18:14:35,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {705#true} is VALID [2018-11-14 18:14:35,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:14:35,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #61#return; {705#true} is VALID [2018-11-14 18:14:35,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 18:14:35,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !~bvslt32(~j~0, 10bv32); {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-14 18:14:35,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {725#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {771#(and (= |main_~#cont~0.offset| (_ bv0 32)) (bvsge main_~i~0 (_ bv0 32)) (= (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32)) main_~pa~0.offset) (= (_ bv0 32) |main_~#array~0.offset|) (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32))) |main_#t~mem8|) (= |main_~#array~0.base| main_~pa~0.base) (bvslt main_~i~0 (_ bv10 32)))} is VALID [2018-11-14 18:14:35,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {771#(and (= |main_~#cont~0.offset| (_ bv0 32)) (bvsge main_~i~0 (_ bv0 32)) (= (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32)) main_~pa~0.offset) (= (_ bv0 32) |main_~#array~0.offset|) (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32))) |main_#t~mem8|) (= |main_~#array~0.base| main_~pa~0.base) (bvslt main_~i~0 (_ bv10 32)))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {775#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:14:35,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {775#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} assume true; {775#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:14:35,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {775#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {782#(and (bvsgt |main_#t~mem10| (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (bvadd |main_#t~mem10| (_ bv4294967286 32)) main_~i~0))} is VALID [2018-11-14 18:14:35,992 INFO L273 TraceCheckUtils]: 24: Hoare triple {782#(and (bvsgt |main_#t~mem10| (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (bvadd |main_#t~mem10| (_ bv4294967286 32)) main_~i~0))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {706#false} is VALID [2018-11-14 18:14:35,993 INFO L256 TraceCheckUtils]: 25: Hoare triple {706#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {706#false} is VALID [2018-11-14 18:14:35,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {706#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {706#false} is VALID [2018-11-14 18:14:35,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {706#false} assume true; {706#false} is VALID [2018-11-14 18:14:35,993 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {706#false} {706#false} #59#return; {706#false} is VALID [2018-11-14 18:14:35,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {706#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {706#false} is VALID [2018-11-14 18:14:35,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 18:14:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 18:14:36,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:14:36,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 18:14:36,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:36,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:14:36,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:36,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:14:36,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:14:36,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:14:36,244 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2018-11-14 18:14:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:36,919 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-14 18:14:36,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:14:36,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 18:14:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:14:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 18:14:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:14:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 18:14:36,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-14 18:14:37,688 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-14 18:14:37,690 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:14:37,690 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 18:14:37,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:14:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 18:14:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 18:14:37,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:37,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 18:14:37,728 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:14:37,728 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:14:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:37,730 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-14 18:14:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-14 18:14:37,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:37,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:37,732 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 18:14:37,732 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 18:14:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:37,735 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-14 18:14:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-14 18:14:37,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:37,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:37,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:37,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:14:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-14 18:14:37,738 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2018-11-14 18:14:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:37,739 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-14 18:14:37,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:14:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-14 18:14:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:14:37,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:37,740 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:37,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:37,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1751787951, now seen corresponding path program 1 times [2018-11-14 18:14:37,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:37,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:37,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:14:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:37,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:38,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-14 18:14:38,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {985#true} is VALID [2018-11-14 18:14:38,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 18:14:38,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #61#return; {985#true} is VALID [2018-11-14 18:14:38,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret13 := main(); {985#true} is VALID [2018-11-14 18:14:38,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1005#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:38,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {1005#(= main_~j~0 (_ bv0 32))} assume true; {1005#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:38,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {1005#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1005#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-14 18:14:38,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {1005#(= main_~j~0 (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {1015#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {1025#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {1035#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1045#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {1045#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1045#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:38,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {1045#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {986#false} is VALID [2018-11-14 18:14:38,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {986#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {986#false} is VALID [2018-11-14 18:14:38,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {986#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {986#false} is VALID [2018-11-14 18:14:38,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 18:14:38,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {986#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {986#false} is VALID [2018-11-14 18:14:38,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {986#false} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {986#false} is VALID [2018-11-14 18:14:38,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 18:14:38,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {986#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {986#false} is VALID [2018-11-14 18:14:38,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {986#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {986#false} is VALID [2018-11-14 18:14:38,037 INFO L256 TraceCheckUtils]: 28: Hoare triple {986#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {986#false} is VALID [2018-11-14 18:14:38,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {986#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {986#false} is VALID [2018-11-14 18:14:38,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 18:14:38,037 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {986#false} {986#false} #59#return; {986#false} is VALID [2018-11-14 18:14:38,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {986#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {986#false} is VALID [2018-11-14 18:14:38,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-14 18:14:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 18:14:38,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:14:38,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-14 18:14:38,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {986#false} assume #t~ret12 == 0bv32;havoc #t~ret12; {986#false} is VALID [2018-11-14 18:14:38,252 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {985#true} {986#false} #59#return; {986#false} is VALID [2018-11-14 18:14:38,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 18:14:38,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {985#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {985#true} is VALID [2018-11-14 18:14:38,253 INFO L256 TraceCheckUtils]: 28: Hoare triple {986#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {985#true} is VALID [2018-11-14 18:14:38,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {986#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {986#false} is VALID [2018-11-14 18:14:38,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {986#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {986#false} is VALID [2018-11-14 18:14:38,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 18:14:38,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {986#false} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {986#false} is VALID [2018-11-14 18:14:38,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {986#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {986#false} is VALID [2018-11-14 18:14:38,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 18:14:38,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {986#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {986#false} is VALID [2018-11-14 18:14:38,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {986#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {986#false} is VALID [2018-11-14 18:14:38,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {1136#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {986#false} is VALID [2018-11-14 18:14:38,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {1136#(bvslt main_~j~0 (_ bv10 32))} assume true; {1136#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-14 18:14:38,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1136#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-14 18:14:38,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume true; {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1143#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} assume true; {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1153#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} assume true; {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1163#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} assume true; {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1173#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-14 18:14:38,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret13 := main(); {985#true} is VALID [2018-11-14 18:14:38,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #61#return; {985#true} is VALID [2018-11-14 18:14:38,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 18:14:38,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {985#true} is VALID [2018-11-14 18:14:38,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-14 18:14:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 18:14:38,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:14:38,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:14:38,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-14 18:14:38,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:38,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:14:38,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:38,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:14:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:14:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:14:38,391 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-14 18:14:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:39,429 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-11-14 18:14:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:14:39,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-14 18:14:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:14:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2018-11-14 18:14:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:14:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2018-11-14 18:14:39,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2018-11-14 18:14:39,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:39,580 INFO L225 Difference]: With dead ends: 68 [2018-11-14 18:14:39,580 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 18:14:39,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:14:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 18:14:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-14 18:14:39,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:39,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-14 18:14:39,641 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 18:14:39,641 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 18:14:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:39,644 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 18:14:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 18:14:39,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:39,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:39,645 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-14 18:14:39,646 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-14 18:14:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:39,649 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 18:14:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 18:14:39,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:39,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:39,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:39,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:14:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-14 18:14:39,653 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 34 [2018-11-14 18:14:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:39,654 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-14 18:14:39,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:14:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 18:14:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 18:14:39,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:39,656 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:39,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:39,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1950453329, now seen corresponding path program 2 times [2018-11-14 18:14:39,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:39,691 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:14:39,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:14:39,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:14:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-14 18:14:41,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:42,043 INFO L477 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 15 treesize of output 12 [2018-11-14 18:14:42,055 INFO L477 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 12 treesize of output 11 [2018-11-14 18:14:42,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:42,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:42,126 INFO L477 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 11 treesize of output 8 [2018-11-14 18:14:42,136 INFO L477 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 8 treesize of output 7 [2018-11-14 18:14:42,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:42,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:42,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:42,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:37 [2018-11-14 18:14:42,370 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:47,892 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-14 18:14:48,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {1480#true} call ULTIMATE.init(); {1480#true} is VALID [2018-11-14 18:14:48,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {1480#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1480#true} is VALID [2018-11-14 18:14:48,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:48,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1480#true} {1480#true} #61#return; {1480#true} is VALID [2018-11-14 18:14:48,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {1480#true} call #t~ret13 := main(); {1480#true} is VALID [2018-11-14 18:14:48,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1480#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,502 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume true; {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {1500#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:14:48,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {1500#(= |main_~#cont~0.offset| (_ bv0 32))} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {1600#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) |main_#t~mem8|))} is VALID [2018-11-14 18:14:48,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {1600#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) |main_#t~mem8|))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {1604#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {1604#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume true; {1604#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {1604#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1611#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {1611#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {1615#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {1615#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume true; {1615#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {1615#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1622#(and (= |main_#t~mem10| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:48,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {1622#(and (= |main_#t~mem10| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {1626#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:14:50,835 INFO L256 TraceCheckUtils]: 46: Hoare triple {1626#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1630#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))))} is UNKNOWN [2018-11-14 18:14:50,840 INFO L273 TraceCheckUtils]: 47: Hoare triple {1630#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))))} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1634#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:14:50,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {1634#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1634#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:14:50,865 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1634#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} {1626#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} #59#return; {1641#(= (_ bv1 32) |main_#t~ret12|)} is VALID [2018-11-14 18:14:50,876 INFO L273 TraceCheckUtils]: 50: Hoare triple {1641#(= (_ bv1 32) |main_#t~ret12|)} assume #t~ret12 == 0bv32;havoc #t~ret12; {1481#false} is VALID [2018-11-14 18:14:50,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2018-11-14 18:14:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-14 18:14:50,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:14:57,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2018-11-14 18:14:57,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {1651#(not (= |main_#t~ret12| (_ bv0 32)))} assume #t~ret12 == 0bv32;havoc #t~ret12; {1481#false} is VALID [2018-11-14 18:14:57,112 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1659#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} {1655#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} #59#return; {1651#(not (= |main_#t~ret12| (_ bv0 32)))} is VALID [2018-11-14 18:14:57,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {1659#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} assume true; {1659#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} is VALID [2018-11-14 18:14:57,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {1480#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1659#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} is VALID [2018-11-14 18:14:57,114 INFO L256 TraceCheckUtils]: 46: Hoare triple {1655#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1480#true} is VALID [2018-11-14 18:14:57,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {1669#(or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0) (bvslt main_~i~0 |main_#t~mem10|))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {1655#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} is VALID [2018-11-14 18:14:57,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {1673#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1669#(or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0) (bvslt main_~i~0 |main_#t~mem10|))} is VALID [2018-11-14 18:14:57,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {1673#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} assume true; {1673#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} is VALID [2018-11-14 18:14:57,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {1680#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem10|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {1673#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} is VALID [2018-11-14 18:14:57,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {1684#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1680#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem10|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} is VALID [2018-11-14 18:14:57,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {1684#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} assume true; {1684#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} is VALID [2018-11-14 18:14:57,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {1691#(or (not (bvsgt |main_#t~mem8| (_ bv0 32))) (forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0))))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {1684#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} is VALID [2018-11-14 18:14:57,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {1480#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {1691#(or (not (bvsgt |main_#t~mem8| (_ bv0 32))) (forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0))))} is VALID [2018-11-14 18:14:57,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {1480#true} assume !~bvslt32(~j~0, 10bv32); {1480#true} is VALID [2018-11-14 18:14:57,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {1480#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1480#true} is VALID [2018-11-14 18:14:57,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {1480#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1480#true} is VALID [2018-11-14 18:14:57,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {1480#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1480#true} is VALID [2018-11-14 18:14:57,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {1480#true} call #t~ret13 := main(); {1480#true} is VALID [2018-11-14 18:14:57,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1480#true} {1480#true} #61#return; {1480#true} is VALID [2018-11-14 18:14:57,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-14 18:14:57,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1480#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1480#true} is VALID [2018-11-14 18:14:57,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {1480#true} call ULTIMATE.init(); {1480#true} is VALID [2018-11-14 18:14:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-14 18:14:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:14:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-14 18:14:57,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-11-14 18:14:57,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:57,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:15:01,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 18:15:01,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:15:01,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:15:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=308, Unknown=3, NotChecked=0, Total=380 [2018-11-14 18:15:01,796 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 20 states. [2018-11-14 18:15:15,898 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-14 18:15:20,452 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-14 18:15:31,983 WARN L179 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-14 18:15:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:15:31,989 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 18:15:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:15:31,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-11-14 18:15:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:15:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:15:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-14 18:15:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:15:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-14 18:15:31,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2018-11-14 18:15:34,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:15:34,674 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:15:34,674 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:15:34,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=109, Invalid=394, Unknown=3, NotChecked=0, Total=506 [2018-11-14 18:15:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:15:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:15:34,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:15:34,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:15:34,676 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:15:34,676 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:15:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:15:34,676 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:15:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:15:34,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:15:34,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:15:34,677 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:15:34,677 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:15:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:15:34,678 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:15:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:15:34,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:15:34,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:15:34,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:15:34,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:15:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:15:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:15:34,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-11-14 18:15:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:15:34,680 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:15:34,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:15:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:15:34,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:15:34,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:15:35,548 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-11-14 18:15:38,398 WARN L179 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 1 [2018-11-14 18:15:38,509 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:15:38,510 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:15:38,510 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:15:38,510 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:15:38,510 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:15:38,510 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:15:38,510 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:15:38,511 INFO L421 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (and (= .cse0 main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= .cse1 main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|) (bvsgt (select (select |#memory_int| .cse1) .cse0) (_ bv0 32)))) [2018-11-14 18:15:38,511 INFO L421 ceAbstractionStarter]: At program point L37-5(lines 37 39) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (let ((.cse2 (select (select |#memory_int| .cse1) .cse0))) (and (= .cse0 main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= .cse1 main_~pa~0.base) (not (bvslt main_~i~0 .cse2)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|) (bvsgt .cse2 (_ bv0 32))))) [2018-11-14 18:15:38,511 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 30) no Hoare annotation was computed. [2018-11-14 18:15:38,511 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-11-14 18:15:38,511 INFO L425 ceAbstractionStarter]: For program point L27-3(lines 27 30) no Hoare annotation was computed. [2018-11-14 18:15:38,511 INFO L421 ceAbstractionStarter]: At program point L27-4(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|)) [2018-11-14 18:15:38,511 INFO L425 ceAbstractionStarter]: For program point L27-5(lines 21 50) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-11-14 18:15:38,512 INFO L421 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2018-11-14 18:15:38,512 INFO L425 ceAbstractionStarter]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2018-11-14 18:15:38,513 INFO L428 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-11-14 18:15:38,513 INFO L425 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-11-14 18:15:38,513 INFO L425 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-11-14 18:15:38,515 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:15:38,516 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-14 18:15:38,516 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:15:38,516 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-5 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-5 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-5 has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-14 18:15:38,517 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-14 18:15:38,518 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2018-11-14 18:15:38,519 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2018-11-14 18:15:38,519 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:15:38,525 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,526 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,527 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,527 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,529 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,530 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,530 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,531 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,531 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,531 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,534 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,534 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,535 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,535 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:15:38 BoogieIcfgContainer [2018-11-14 18:15:38,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:15:38,541 INFO L168 Benchmark]: Toolchain (without parser) took 68644.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 876.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -673.2 MB). Peak memory consumption was 202.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:15:38,542 INFO L168 Benchmark]: CDTParser took 0.24 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-14 18:15:38,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.83 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-14 18:15:38,543 INFO L168 Benchmark]: Boogie Preprocessor took 52.12 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-14 18:15:38,543 INFO L168 Benchmark]: RCFGBuilder took 799.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:15:38,544 INFO L168 Benchmark]: TraceAbstraction took 67383.72 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 116.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:15:38,548 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.24 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 403.83 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 Preprocessor took 52.12 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 799.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67383.72 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 116.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2018-11-14 18:15:38,557 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,557 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,558 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,558 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,559 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,561 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 18:15:38,561 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-14 18:15:38,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 18:15:38,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 18:15:38,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((~bvadd64(#memory_$Pointer$[cont][cont], 4bv32) == pa && ~bvslt32(~bvadd64(i, 4294967295bv32), unknown-#memory_int-unknown[pa][pa])) && #memory_$Pointer$[cont][cont] == pa) && cont == 0bv32) && 0bv32 == array) && ~bvsgt32(unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][~bvadd64(#memory_$Pointer$[cont][cont], 4bv32)], 0bv32) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0bv32 && 0bv32 == array - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 67.2s OverallTime, 6 OverallIterations, 11 TraceHistogramMax, 37.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 36 SDslu, 369 SDs, 0 SdLazy, 225 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 27 NumberOfFragments, 129 HoareAnnotationTreeSize, 14 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 193 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 174 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 273 ConstructedInterpolants, 9 QuantifiedInterpolants, 75000 SizeOfPredicates, 36 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 344/404 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...