java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:41,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:41,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:41,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:41,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:41,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:41,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:41,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:41,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:41,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:41,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:41,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:41,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:41,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:41,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:41,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:41,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:41,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:41,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:41,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:41,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:41,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:41,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:41,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:41,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:41,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:41,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:41,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:41,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:41,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:41,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:41,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:41,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:41,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:41,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:41,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:41,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:41,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:41,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:41,444 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:41,444 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:41,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:41,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:41,445 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:41,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:41,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:41,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:41,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:41,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:41,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:41,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:41,447 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:41,447 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:41,447 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:41,447 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:41,447 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:41,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:41,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:41,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:41,448 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:41,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:41,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:41,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:41,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:41,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:41,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:41,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:41,451 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:41,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:41,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:41,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:41,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:41,522 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:41,523 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-23 12:54:41,580 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f441199d/19d41be153064b1f941037d3111cf122/FLAGc48a78ac8 [2018-11-23 12:54:42,044 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:42,045 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c [2018-11-23 12:54:42,050 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f441199d/19d41be153064b1f941037d3111cf122/FLAGc48a78ac8 [2018-11-23 12:54:42,394 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f441199d/19d41be153064b1f941037d3111cf122 [2018-11-23 12:54:42,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:42,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:42,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:42,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:42,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:42,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c18179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42, skipping insertion in model container [2018-11-23 12:54:42,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:42,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:42,726 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:42,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:42,778 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:42,804 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:42,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42 WrapperNode [2018-11-23 12:54:42,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:42,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:42,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:42,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:42,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:42,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:42,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:42,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:42,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... [2018-11-23 12:54:42,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:42,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:42,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:42,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:42,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:43,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:43,002 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:43,713 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:43,714 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:54:43,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43 BoogieIcfgContainer [2018-11-23 12:54:43,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:43,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:43,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:43,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:43,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:42" (1/3) ... [2018-11-23 12:54:43,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2734a5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:43, skipping insertion in model container [2018-11-23 12:54:43,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:42" (2/3) ... [2018-11-23 12:54:43,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2734a5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:43, skipping insertion in model container [2018-11-23 12:54:43,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43" (3/3) ... [2018-11-23 12:54:43,723 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-11-23 12:54:43,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:43,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:43,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:43,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:43,786 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:43,786 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:43,787 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:43,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:43,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:43,788 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:43,788 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:43,788 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:54:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:54:43,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:43,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:43,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:43,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-23 12:54:43,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:43,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:43,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:44,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:54:44,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:54:44,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:44,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2018-11-23 12:54:44,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret13 := main(); {28#true} is VALID [2018-11-23 12:54:44,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {28#true} is VALID [2018-11-23 12:54:44,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:54:44,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {29#false} is VALID [2018-11-23 12:54:44,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {29#false} is VALID [2018-11-23 12:54:44,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 12:54:44,011 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#true} is VALID [2018-11-23 12:54:44,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {28#true} is VALID [2018-11-23 12:54:44,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:44,012 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #62#return; {29#false} is VALID [2018-11-23 12:54:44,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {29#false} is VALID [2018-11-23 12:54:44,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret12;havoc #t~ret12; {29#false} is VALID [2018-11-23 12:54:44,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:54:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:44,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:44,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:44,024 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:44,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:44,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:44,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:44,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:44,228 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:54:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,362 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:54:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:44,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:44,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:54:44,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:44,545 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:44,545 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:54:44,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:54:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:54:44,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:44,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:44,616 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:44,616 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,619 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:44,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,621 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:44,621 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,625 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:44,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:44,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:54:44,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:54:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:44,633 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:54:44,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:54:44,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:44,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:44,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:44,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-23 12:54:44,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:44,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 12:54:44,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {156#true} is VALID [2018-11-23 12:54:44,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:44,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #58#return; {156#true} is VALID [2018-11-23 12:54:44,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret13 := main(); {156#true} is VALID [2018-11-23 12:54:44,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {158#(= main_~j~0 0)} is VALID [2018-11-23 12:54:44,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(= main_~j~0 0)} assume !(~j~0 < 10); {157#false} is VALID [2018-11-23 12:54:44,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {157#false} is VALID [2018-11-23 12:54:44,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {157#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {157#false} is VALID [2018-11-23 12:54:44,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {157#false} is VALID [2018-11-23 12:54:44,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {157#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {157#false} is VALID [2018-11-23 12:54:44,765 INFO L256 TraceCheckUtils]: 11: Hoare triple {157#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {156#true} is VALID [2018-11-23 12:54:44,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {156#true} is VALID [2018-11-23 12:54:44,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:44,766 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {156#true} {157#false} #62#return; {157#false} is VALID [2018-11-23 12:54:44,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {157#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {157#false} is VALID [2018-11-23 12:54:44,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {157#false} assume 0 == #t~ret12;havoc #t~ret12; {157#false} is VALID [2018-11-23 12:54:44,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 12:54:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:44,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:44,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:54:44,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:44,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:44,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:54:44,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:44,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:54:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:54:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:44,830 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 12:54:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,035 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:54:45,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:54:45,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:45,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:54:45,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:45,310 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:45,311 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:54:45,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:54:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 12:54:45,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:45,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:45,454 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:45,455 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,457 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:45,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,458 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:45,459 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,461 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:45,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:45,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:54:45,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 12:54:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:45,465 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:54:45,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:54:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:54:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:45,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:45,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:45,467 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:45,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-23 12:54:45,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:45,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:45,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:45,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:45,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:45,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret13 := main(); {284#true} is VALID [2018-11-23 12:54:45,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:45,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:45,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:45,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:45,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {285#false} is VALID [2018-11-23 12:54:45,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {285#false} is VALID [2018-11-23 12:54:45,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:45,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {285#false} is VALID [2018-11-23 12:54:45,621 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {284#true} is VALID [2018-11-23 12:54:45,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {284#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {284#true} is VALID [2018-11-23 12:54:45,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:45,622 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {284#true} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:45,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:45,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret12;havoc #t~ret12; {285#false} is VALID [2018-11-23 12:54:45,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:45,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:45,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:45,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:45,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:46,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:46,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:46,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:46,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:46,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret13 := main(); {284#true} is VALID [2018-11-23 12:54:46,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:46,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:46,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:46,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:46,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {285#false} is VALID [2018-11-23 12:54:46,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {285#false} is VALID [2018-11-23 12:54:46,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:46,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {285#false} is VALID [2018-11-23 12:54:46,061 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {285#false} is VALID [2018-11-23 12:54:46,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {285#false} is VALID [2018-11-23 12:54:46,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume true; {285#false} is VALID [2018-11-23 12:54:46,062 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {285#false} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:46,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:46,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret12;havoc #t~ret12; {285#false} is VALID [2018-11-23 12:54:46,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:46,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:46,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:54:46,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:46,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:46,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:46,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:46,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:46,199 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 12:54:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:46,413 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:54:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:46,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:46,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 12:54:46,574 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-23 12:54:46,575 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:54:46,575 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:54:46,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:54:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:54:46,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:46,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:46,599 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:46,599 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:46,602 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:46,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:46,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:46,603 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:46,603 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:46,605 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:46,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:46,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:46,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:46,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:54:46,608 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 12:54:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:46,609 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:54:46,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:54:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:54:46,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:46,610 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:46,610 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:46,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-23 12:54:46,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:46,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:46,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:46,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:46,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret13 := main(); {481#true} is VALID [2018-11-23 12:54:46,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:46,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:46,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:46,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:46,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:46,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 10); {482#false} is VALID [2018-11-23 12:54:46,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {482#false} is VALID [2018-11-23 12:54:46,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {482#false} is VALID [2018-11-23 12:54:46,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:46,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {482#false} is VALID [2018-11-23 12:54:46,796 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {481#true} is VALID [2018-11-23 12:54:46,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {481#true} is VALID [2018-11-23 12:54:46,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:46,797 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {481#true} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:46,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:46,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret12;havoc #t~ret12; {482#false} is VALID [2018-11-23 12:54:46,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:46,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:46,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:54:46,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:47,116 INFO L478 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 17 treesize of output 13 [2018-11-23 12:54:47,126 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:47,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:47,134 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-23 12:54:47,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:47,138 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:47,138 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= (+ main_~i~0 10) .cse0) (<= .cse0 |main_#t~mem10|))) [2018-11-23 12:54:47,138 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 10) |main_#t~mem10|) [2018-11-23 12:54:47,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:47,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:47,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:47,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:47,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret13 := main(); {481#true} is VALID [2018-11-23 12:54:47,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {481#true} is VALID [2018-11-23 12:54:47,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {481#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {481#true} is VALID [2018-11-23 12:54:47,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {481#true} is VALID [2018-11-23 12:54:47,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {481#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {481#true} is VALID [2018-11-23 12:54:47,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {481#true} is VALID [2018-11-23 12:54:47,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(~j~0 < 10); {481#true} is VALID [2018-11-23 12:54:47,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#true} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {522#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:47,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {522#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {526#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:47,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {526#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {530#(<= (+ main_~i~0 10) |main_#t~mem10|)} is VALID [2018-11-23 12:54:47,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {530#(<= (+ main_~i~0 10) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {482#false} is VALID [2018-11-23 12:54:47,183 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {482#false} is VALID [2018-11-23 12:54:47,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {482#false} is VALID [2018-11-23 12:54:47,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-23 12:54:47,184 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {482#false} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:47,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:47,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret12;havoc #t~ret12; {482#false} is VALID [2018-11-23 12:54:47,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:54:47,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:54:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 12:54:47,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 12:54:47,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:47,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:47,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:47,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:47,315 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-23 12:54:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:47,638 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 12:54:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:47,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 12:54:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 12:54:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 12:54:47,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2018-11-23 12:54:47,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:47,730 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:54:47,730 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:54:47,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:54:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:54:47,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:47,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:47,755 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:47,755 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:47,757 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:47,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:47,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:47,758 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:47,758 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:47,761 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:47,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:47,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:47,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:47,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:54:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:54:47,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-11-23 12:54:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:47,764 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:54:47,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:54:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:54:47,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:47,766 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:47,766 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:47,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2018-11-23 12:54:47,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:47,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:47,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 12:54:47,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 12:54:47,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:47,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #58#return; {709#true} is VALID [2018-11-23 12:54:47,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret13 := main(); {709#true} is VALID [2018-11-23 12:54:47,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {711#(= main_~j~0 0)} is VALID [2018-11-23 12:54:47,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {711#(= main_~j~0 0)} is VALID [2018-11-23 12:54:47,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {711#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:47,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:47,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {712#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:47,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:47,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {714#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:47,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(<= main_~j~0 3)} assume !(~j~0 < 10); {710#false} is VALID [2018-11-23 12:54:47,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {710#false} is VALID [2018-11-23 12:54:47,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {710#false} is VALID [2018-11-23 12:54:47,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:47,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {710#false} is VALID [2018-11-23 12:54:47,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:47,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {710#false} is VALID [2018-11-23 12:54:47,931 INFO L256 TraceCheckUtils]: 19: Hoare triple {710#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {709#true} is VALID [2018-11-23 12:54:47,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {709#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {709#true} is VALID [2018-11-23 12:54:47,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:47,932 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {709#true} {710#false} #62#return; {710#false} is VALID [2018-11-23 12:54:47,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {710#false} is VALID [2018-11-23 12:54:47,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0 == #t~ret12;havoc #t~ret12; {710#false} is VALID [2018-11-23 12:54:47,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 12:54:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:47,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:47,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:48,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 12:54:48,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 12:54:48,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:48,080 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #58#return; {709#true} is VALID [2018-11-23 12:54:48,080 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret13 := main(); {709#true} is VALID [2018-11-23 12:54:48,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {733#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:48,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {733#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {733#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:48,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:48,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:48,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {712#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:48,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:48,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {714#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:48,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(<= main_~j~0 3)} assume !(~j~0 < 10); {710#false} is VALID [2018-11-23 12:54:48,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {710#false} is VALID [2018-11-23 12:54:48,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {710#false} is VALID [2018-11-23 12:54:48,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:48,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {710#false} is VALID [2018-11-23 12:54:48,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:48,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {710#false} is VALID [2018-11-23 12:54:48,089 INFO L256 TraceCheckUtils]: 19: Hoare triple {710#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {710#false} is VALID [2018-11-23 12:54:48,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {710#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {710#false} is VALID [2018-11-23 12:54:48,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume true; {710#false} is VALID [2018-11-23 12:54:48,090 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {710#false} {710#false} #62#return; {710#false} is VALID [2018-11-23 12:54:48,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {710#false} is VALID [2018-11-23 12:54:48,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0 == #t~ret12;havoc #t~ret12; {710#false} is VALID [2018-11-23 12:54:48,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 12:54:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:48,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:48,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:54:48,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:54:48,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:48,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:48,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:48,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:48,154 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-23 12:54:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,324 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:54:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:48,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:54:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:48,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:54:48,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:48,478 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:54:48,479 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:54:48,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:54:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:54:48,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:48,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:48,494 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:48,494 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,497 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:48,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,498 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:48,498 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,500 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:48,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:48,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:54:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:54:48,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 12:54:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:48,503 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:54:48,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:54:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:54:48,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:48,505 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:48,505 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:48,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2018-11-23 12:54:48,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:48,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:48,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2018-11-23 12:54:48,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {959#true} is VALID [2018-11-23 12:54:48,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:48,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2018-11-23 12:54:48,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2018-11-23 12:54:48,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {961#(= main_~j~0 0)} is VALID [2018-11-23 12:54:48,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {961#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {961#(= main_~j~0 0)} is VALID [2018-11-23 12:54:48,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {961#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:48,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {962#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:48,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {962#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:48,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {963#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:48,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {963#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:48,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:48,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:48,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#(<= main_~j~0 4)} assume !(~j~0 < 10); {960#false} is VALID [2018-11-23 12:54:48,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2018-11-23 12:54:48,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2018-11-23 12:54:48,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:48,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2018-11-23 12:54:48,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:48,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2018-11-23 12:54:48,758 INFO L256 TraceCheckUtils]: 21: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {959#true} is VALID [2018-11-23 12:54:48,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {959#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {959#true} is VALID [2018-11-23 12:54:48,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:48,760 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {959#true} {960#false} #62#return; {960#false} is VALID [2018-11-23 12:54:48,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2018-11-23 12:54:48,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2018-11-23 12:54:48,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {960#false} assume !false; {960#false} is VALID [2018-11-23 12:54:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:48,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:48,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:48,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:48,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:48,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:48,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:49,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2018-11-23 12:54:49,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {959#true} is VALID [2018-11-23 12:54:49,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:49,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2018-11-23 12:54:49,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2018-11-23 12:54:49,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:49,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {984#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:49,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {984#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:49,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {962#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:49,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {962#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:49,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {963#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:49,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {963#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:49,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:49,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:49,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#(<= main_~j~0 4)} assume !(~j~0 < 10); {960#false} is VALID [2018-11-23 12:54:49,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2018-11-23 12:54:49,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2018-11-23 12:54:49,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:49,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2018-11-23 12:54:49,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:49,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2018-11-23 12:54:49,027 INFO L256 TraceCheckUtils]: 21: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {960#false} is VALID [2018-11-23 12:54:49,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {960#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {960#false} is VALID [2018-11-23 12:54:49,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {960#false} assume true; {960#false} is VALID [2018-11-23 12:54:49,028 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {960#false} {960#false} #62#return; {960#false} is VALID [2018-11-23 12:54:49,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2018-11-23 12:54:49,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2018-11-23 12:54:49,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {960#false} assume !false; {960#false} is VALID [2018-11-23 12:54:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:49,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:54:49,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:54:49,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:49,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:49,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:49,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:49,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:49,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:49,104 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-11-23 12:54:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,296 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:54:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:49,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:54:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:49,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-23 12:54:49,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:49,412 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:54:49,412 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:54:49,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:54:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:54:49,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:49,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:49,461 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:49,461 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,464 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:49,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:49,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:49,465 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:49,465 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,467 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:49,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:49,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:49,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:49,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:54:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:54:49,470 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 12:54:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:49,471 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:54:49,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:54:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:54:49,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:49,472 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:49,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:49,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2018-11-23 12:54:49,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:49,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 12:54:49,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 12:54:49,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:49,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #58#return; {1226#true} is VALID [2018-11-23 12:54:49,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret13 := main(); {1226#true} is VALID [2018-11-23 12:54:49,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1228#(= main_~j~0 0)} is VALID [2018-11-23 12:54:49,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {1228#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1228#(= main_~j~0 0)} is VALID [2018-11-23 12:54:49,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {1228#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1229#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:49,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1229#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1229#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:49,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {1229#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1230#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:49,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {1230#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1230#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:49,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1231#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:49,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {1231#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1231#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:49,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {1231#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1232#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:49,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {1232#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1232#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:49,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {1232#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1233#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:49,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {1233#(<= main_~j~0 5)} assume !(~j~0 < 10); {1227#false} is VALID [2018-11-23 12:54:49,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {1227#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1227#false} is VALID [2018-11-23 12:54:49,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {1227#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1227#false} is VALID [2018-11-23 12:54:49,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {1227#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1227#false} is VALID [2018-11-23 12:54:49,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {1227#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1227#false} is VALID [2018-11-23 12:54:49,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1227#false} is VALID [2018-11-23 12:54:49,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1227#false} is VALID [2018-11-23 12:54:49,643 INFO L256 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1226#true} is VALID [2018-11-23 12:54:49,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {1226#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1226#true} is VALID [2018-11-23 12:54:49,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:49,644 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1226#true} {1227#false} #62#return; {1227#false} is VALID [2018-11-23 12:54:49,644 INFO L273 TraceCheckUtils]: 27: Hoare triple {1227#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1227#false} is VALID [2018-11-23 12:54:49,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} assume 0 == #t~ret12;havoc #t~ret12; {1227#false} is VALID [2018-11-23 12:54:49,645 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 12:54:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:49,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:49,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:49,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:54:49,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:49,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:49,982 INFO L478 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 17 treesize of output 13 [2018-11-23 12:54:49,990 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:50,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:50,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:50,040 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-23 12:54:50,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:50,042 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:50,042 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= (+ main_~i~0 9) .cse0) (<= .cse0 |main_#t~mem10|))) [2018-11-23 12:54:50,043 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 9) |main_#t~mem10|) [2018-11-23 12:54:50,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 12:54:50,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 12:54:50,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:50,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #58#return; {1226#true} is VALID [2018-11-23 12:54:50,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret13 := main(); {1226#true} is VALID [2018-11-23 12:54:50,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1226#true} is VALID [2018-11-23 12:54:50,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:50,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:50,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:50,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:50,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:50,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:50,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:50,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:50,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:50,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:50,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#true} assume !(~j~0 < 10); {1226#true} is VALID [2018-11-23 12:54:50,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#true} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1288#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:50,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {1288#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1299#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,077 INFO L273 TraceCheckUtils]: 21: Hoare triple {1299#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1303#(<= (+ main_~i~0 9) |main_#t~mem10|)} is VALID [2018-11-23 12:54:50,078 INFO L273 TraceCheckUtils]: 22: Hoare triple {1303#(<= (+ main_~i~0 9) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1227#false} is VALID [2018-11-23 12:54:50,078 INFO L256 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1227#false} is VALID [2018-11-23 12:54:50,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {1227#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1227#false} is VALID [2018-11-23 12:54:50,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {1227#false} assume true; {1227#false} is VALID [2018-11-23 12:54:50,079 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1227#false} {1227#false} #62#return; {1227#false} is VALID [2018-11-23 12:54:50,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {1227#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1227#false} is VALID [2018-11-23 12:54:50,079 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} assume 0 == #t~ret12;havoc #t~ret12; {1227#false} is VALID [2018-11-23 12:54:50,080 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 12:54:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:54:50,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:50,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:54:50,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 12:54:50,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:50,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:54:50,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:50,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:54:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:54:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:50,242 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-23 12:54:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,640 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-23 12:54:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:54:50,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 12:54:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2018-11-23 12:54:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2018-11-23 12:54:50,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2018-11-23 12:54:50,729 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-23 12:54:50,730 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:54:50,730 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:54:50,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:54:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:54:50,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:50,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:50,777 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:50,777 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,778 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:50,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:50,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:50,779 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:50,779 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:50,780 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:50,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:50,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:50,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:50,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:54:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:54:50,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-11-23 12:54:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:50,787 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:54:50,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:54:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:54:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:54:50,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:50,789 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:50,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:50,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2018-11-23 12:54:50,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:50,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:51,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2018-11-23 12:54:51,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {1527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1527#true} is VALID [2018-11-23 12:54:51,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:51,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #58#return; {1527#true} is VALID [2018-11-23 12:54:51,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret13 := main(); {1527#true} is VALID [2018-11-23 12:54:51,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {1527#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1529#(= main_~j~0 0)} is VALID [2018-11-23 12:54:51,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {1529#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1529#(= main_~j~0 0)} is VALID [2018-11-23 12:54:51,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {1529#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1530#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:51,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {1530#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1530#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:51,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {1530#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1531#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:51,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {1531#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1531#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:51,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {1531#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1532#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:51,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {1532#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1532#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:51,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {1532#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1533#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:51,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {1533#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1533#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:51,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {1533#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1534#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:51,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {1534#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1534#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:51,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {1534#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1535#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:51,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {1535#(<= main_~j~0 6)} assume !(~j~0 < 10); {1528#false} is VALID [2018-11-23 12:54:51,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {1528#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1528#false} is VALID [2018-11-23 12:54:51,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {1528#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1528#false} is VALID [2018-11-23 12:54:51,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:51,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {1528#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1528#false} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {1528#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1528#false} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {1528#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1528#false} is VALID [2018-11-23 12:54:51,204 INFO L256 TraceCheckUtils]: 27: Hoare triple {1528#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1527#true} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 28: Hoare triple {1527#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1527#true} is VALID [2018-11-23 12:54:51,204 INFO L273 TraceCheckUtils]: 29: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:51,205 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1527#true} {1528#false} #62#return; {1528#false} is VALID [2018-11-23 12:54:51,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {1528#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1528#false} is VALID [2018-11-23 12:54:51,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {1528#false} assume 0 == #t~ret12;havoc #t~ret12; {1528#false} is VALID [2018-11-23 12:54:51,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2018-11-23 12:54:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:51,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:51,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:51,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:51,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:51,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:51,555 INFO L478 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 17 treesize of output 13 [2018-11-23 12:54:51,565 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:51,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:51,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:51,584 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-23 12:54:51,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:51,587 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:51,587 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= .cse0 |main_#t~mem10|) (<= (+ main_~i~0 8) .cse0))) [2018-11-23 12:54:51,587 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 8) |main_#t~mem10|) [2018-11-23 12:54:51,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2018-11-23 12:54:51,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {1527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1527#true} is VALID [2018-11-23 12:54:51,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:51,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #58#return; {1527#true} is VALID [2018-11-23 12:54:51,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret13 := main(); {1527#true} is VALID [2018-11-23 12:54:51,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {1527#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1527#true} is VALID [2018-11-23 12:54:51,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:51,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:51,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#true} assume !(~j~0 < 10); {1527#true} is VALID [2018-11-23 12:54:51,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#true} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1596#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:51,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {1596#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:51,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:51,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:51,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:51,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1614#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:51,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1618#(<= (+ main_~i~0 8) |main_#t~mem10|)} is VALID [2018-11-23 12:54:51,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {1618#(<= (+ main_~i~0 8) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1528#false} is VALID [2018-11-23 12:54:51,683 INFO L256 TraceCheckUtils]: 27: Hoare triple {1528#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1528#false} is VALID [2018-11-23 12:54:51,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {1528#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1528#false} is VALID [2018-11-23 12:54:51,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {1528#false} assume true; {1528#false} is VALID [2018-11-23 12:54:51,683 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1528#false} {1528#false} #62#return; {1528#false} is VALID [2018-11-23 12:54:51,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {1528#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1528#false} is VALID [2018-11-23 12:54:51,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {1528#false} assume 0 == #t~ret12;havoc #t~ret12; {1528#false} is VALID [2018-11-23 12:54:51,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2018-11-23 12:54:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:54:51,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:51,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 12:54:51,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 12:54:51,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:51,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:54:51,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:51,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:54:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:54:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:51,858 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-11-23 12:54:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:52,718 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-23 12:54:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:54:52,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 12:54:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:54:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:54:52,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2018-11-23 12:54:52,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:52,865 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:54:52,865 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:54:52,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:54:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:54:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:54:52,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:52,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:52,938 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:52,938 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:52,941 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:52,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:52,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:52,942 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:52,942 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:52,943 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:52,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:52,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:52,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:52,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:54:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:54:52,946 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-23 12:54:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:52,946 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:54:52,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:54:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:54:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:52,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:52,947 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:52,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:52,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2018-11-23 12:54:52,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:52,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:52,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:52,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:52,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:53,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1867#true} is VALID [2018-11-23 12:54:53,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {1867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1867#true} is VALID [2018-11-23 12:54:53,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:53,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #58#return; {1867#true} is VALID [2018-11-23 12:54:53,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret13 := main(); {1867#true} is VALID [2018-11-23 12:54:53,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {1867#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1869#(= main_~j~0 0)} is VALID [2018-11-23 12:54:53,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {1869#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1869#(= main_~j~0 0)} is VALID [2018-11-23 12:54:53,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {1869#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:53,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1870#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:53,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {1870#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:53,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {1871#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:53,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:53,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:53,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {1872#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:53,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {1873#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:53,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {1873#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:53,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:53,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:53,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {1875#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:53,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {1875#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1876#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:53,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#(<= main_~j~0 7)} assume !(~j~0 < 10); {1868#false} is VALID [2018-11-23 12:54:53,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {1868#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1868#false} is VALID [2018-11-23 12:54:53,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {1868#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1868#false} is VALID [2018-11-23 12:54:53,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:53,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:53,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:53,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:53,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:53,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:53,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:53,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {1868#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1868#false} is VALID [2018-11-23 12:54:53,169 INFO L256 TraceCheckUtils]: 31: Hoare triple {1868#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1867#true} is VALID [2018-11-23 12:54:53,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {1867#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1867#true} is VALID [2018-11-23 12:54:53,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:53,170 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1867#true} {1868#false} #62#return; {1868#false} is VALID [2018-11-23 12:54:53,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {1868#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1868#false} is VALID [2018-11-23 12:54:53,170 INFO L273 TraceCheckUtils]: 36: Hoare triple {1868#false} assume 0 == #t~ret12;havoc #t~ret12; {1868#false} is VALID [2018-11-23 12:54:53,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {1868#false} assume !false; {1868#false} is VALID [2018-11-23 12:54:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:53,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:53,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:56,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:54:56,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:56,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:57,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1867#true} is VALID [2018-11-23 12:54:57,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {1867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1867#true} is VALID [2018-11-23 12:54:57,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:57,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #58#return; {1867#true} is VALID [2018-11-23 12:54:57,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret13 := main(); {1867#true} is VALID [2018-11-23 12:54:57,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {1867#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1895#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:57,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {1895#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1895#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:57,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {1895#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {1870#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {1870#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {1871#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {1872#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {1873#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {1873#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,041 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {1875#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {1875#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1876#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:57,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#(<= main_~j~0 7)} assume !(~j~0 < 10); {1868#false} is VALID [2018-11-23 12:54:57,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {1868#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1868#false} is VALID [2018-11-23 12:54:57,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {1868#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1868#false} is VALID [2018-11-23 12:54:57,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:57,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:57,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:57,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:57,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:57,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:57,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:57,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {1868#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1868#false} is VALID [2018-11-23 12:54:57,046 INFO L256 TraceCheckUtils]: 31: Hoare triple {1868#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1868#false} is VALID [2018-11-23 12:54:57,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {1868#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1868#false} is VALID [2018-11-23 12:54:57,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {1868#false} assume true; {1868#false} is VALID [2018-11-23 12:54:57,047 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1868#false} {1868#false} #62#return; {1868#false} is VALID [2018-11-23 12:54:57,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {1868#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1868#false} is VALID [2018-11-23 12:54:57,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {1868#false} assume 0 == #t~ret12;havoc #t~ret12; {1868#false} is VALID [2018-11-23 12:54:57,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {1868#false} assume !false; {1868#false} is VALID [2018-11-23 12:54:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:57,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:57,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:54:57,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:54:57,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:57,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:54:57,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:57,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:54:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:54:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:57,121 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-23 12:54:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:57,398 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:54:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:54:57,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:54:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:57,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 12:54:57,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:57,470 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:54:57,470 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:54:57,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:54:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:54:57,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:57,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:57,489 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:57,489 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:57,490 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:57,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:57,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:57,491 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:57,492 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:57,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:57,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:57,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:57,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:54:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 12:54:57,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-23 12:54:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:57,495 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 12:54:57,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:54:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:54:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:54:57,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:57,496 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:57,496 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:57,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2018-11-23 12:54:57,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:57,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:57,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-23 12:54:57,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2223#true} is VALID [2018-11-23 12:54:57,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:54:57,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #58#return; {2223#true} is VALID [2018-11-23 12:54:57,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-23 12:54:57,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2225#(= main_~j~0 0)} is VALID [2018-11-23 12:54:57,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {2225#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2225#(= main_~j~0 0)} is VALID [2018-11-23 12:54:57,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {2225#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2226#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {2226#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2226#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {2226#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2227#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {2227#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2227#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {2227#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2228#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {2228#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2228#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {2228#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2229#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {2229#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2229#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {2229#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2230#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2230#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {2230#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2231#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {2231#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2231#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {2231#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2232#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:57,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {2232#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2232#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:57,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2232#(<= main_~j~0 7)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2233#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:57,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {2233#(<= main_~j~0 8)} assume !(~j~0 < 10); {2224#false} is VALID [2018-11-23 12:54:57,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {2224#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2224#false} is VALID [2018-11-23 12:54:57,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {2224#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2224#false} is VALID [2018-11-23 12:54:57,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:57,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:57,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:57,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:57,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:57,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:57,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:57,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {2224#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2224#false} is VALID [2018-11-23 12:54:57,846 INFO L256 TraceCheckUtils]: 33: Hoare triple {2224#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2223#true} is VALID [2018-11-23 12:54:57,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {2223#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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {2223#true} is VALID [2018-11-23 12:54:57,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:54:57,846 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2223#true} {2224#false} #62#return; {2224#false} is VALID [2018-11-23 12:54:57,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {2224#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2224#false} is VALID [2018-11-23 12:54:57,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} assume 0 == #t~ret12;havoc #t~ret12; {2224#false} is VALID [2018-11-23 12:54:57,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-23 12:54:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:57,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:57,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:57,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:54:57,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:58,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:58,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:54:58,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-23 12:54:58,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-23 12:54:58,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-23 12:54:58,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-23 12:54:58,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:54:58,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:58,275 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-23 12:54:58,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28 [2018-11-23 12:54:58,279 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:58,279 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_13|, main_~i~0, |main_~#array~0.offset|, |v_#memory_$Pointer$.base_13|, |main_~#array~0.base|]. (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= (store |v_#memory_$Pointer$.base_13| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.base_13| |main_~#cont~0.base|) |main_~#cont~0.offset| |main_~#array~0.base|)) |#memory_$Pointer$.base|) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (= (store |v_#memory_$Pointer$.offset_13| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.offset_13| |main_~#cont~0.base|) |main_~#cont~0.offset| (+ (* 8 main_~i~0) |main_~#array~0.offset|))) |#memory_$Pointer$.offset|) (not (= |main_~#array~0.base| |main_~#cont~0.base|))) [2018-11-23 12:54:58,280 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= .cse0 |main_~#cont~0.base|)))) [2018-11-23 12:55:00,503 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) is different from true [2018-11-23 12:55:06,558 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 12:55:06,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-23 12:55:06,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2223#true} is VALID [2018-11-23 12:55:06,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:55:06,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #58#return; {2223#true} is VALID [2018-11-23 12:55:06,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-23 12:55:06,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume !(~j~0 < 10); {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {2252#(and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #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, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,726 INFO L273 TraceCheckUtils]: 28: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {2307#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2326#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (<= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {2326#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (<= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2330#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} is VALID [2018-11-23 12:55:06,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {2330#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2334#(and (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) |main_#t~mem10|))} is VALID [2018-11-23 12:55:06,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {2334#(and (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) |main_#t~mem10|))} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2338#(and (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0))} is VALID [2018-11-23 12:55:06,737 INFO L256 TraceCheckUtils]: 33: Hoare triple {2338#(and (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0))} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2342#(exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|)))} is VALID [2018-11-23 12:55:06,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {2342#(exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|)))} ~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, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {2346#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|) (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (= |check_#res| 1)) (and (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (= |check_#res| 0)))} is VALID [2018-11-23 12:55:06,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {2346#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|) (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (= |check_#res| 1)) (and (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (= |check_#res| 0)))} assume true; {2346#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|) (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (= |check_#res| 1)) (and (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (= |check_#res| 0)))} is VALID [2018-11-23 12:55:06,747 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2346#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|) (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (= |check_#res| 1)) (and (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (= |check_#res| 0)))} {2338#(and (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#cont~0.base|)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0))} #62#return; {2353#(= |main_#t~ret12| 1)} is VALID [2018-11-23 12:55:06,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {2353#(= |main_#t~ret12| 1)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2353#(= |main_#t~ret12| 1)} is VALID [2018-11-23 12:55:06,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {2353#(= |main_#t~ret12| 1)} assume 0 == #t~ret12;havoc #t~ret12; {2224#false} is VALID [2018-11-23 12:55:06,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-23 12:55:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-23 12:55:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:06,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 12:55:06,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 12:55:06,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:06,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:55:06,865 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-23 12:55:06,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:55:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:55:06,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=270, Unknown=1, NotChecked=34, Total=380 [2018-11-23 12:55:06,866 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2018-11-23 12:55:52,056 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 12:56:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:03,057 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-23 12:56:03,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:56:03,058 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 12:56:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:56:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. [2018-11-23 12:56:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:56:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. [2018-11-23 12:56:03,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 53 transitions. [2018-11-23 12:56:03,374 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-23 12:56:03,375 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:56:03,375 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:56:03,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=227, Invalid=898, Unknown=1, NotChecked=64, Total=1190 [2018-11-23 12:56:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:56:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:56:03,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:03,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:56:03,377 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:56:03,378 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:56:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:03,378 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:56:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:56:03,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:03,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:03,378 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:56:03,379 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:56:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:03,379 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:56:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:56:03,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:03,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:03,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:03,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:56:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:56:03,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-23 12:56:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:03,380 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:03,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:56:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:56:03,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:03,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:56:03,616 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:56:03,616 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:56:03,616 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:56:03,616 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:56:03,616 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:56:03,616 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:56:03,616 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L444 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (not (= .cse0 |main_~#cont~0.base|)) (<= .cse2 main_~i~0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))))) [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L444 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))) [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-23 12:56:03,617 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-23 12:56:03,618 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-11-23 12:56:03,618 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-11-23 12:56:03,618 INFO L444 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-11-23 12:56:03,618 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-23 12:56:03,618 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-11-23 12:56:03,618 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2018-11-23 12:56:03,619 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= .cse0 |main_~#cont~0.base|)) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))) [2018-11-23 12:56:03,619 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-11-23 12:56:03,619 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-11-23 12:56:03,619 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-11-23 12:56:03,621 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:56:03,636 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:56:03,636 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:56:03,636 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:56:03,636 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:56:03,637 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 12:56:03,638 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:56:03,638 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:56:03,638 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:56:03,638 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:56:03,638 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 12:56:03,653 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 12:56:03,654 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 12:56:03,654 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:56:03,654 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:56:03,654 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:56:03,654 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-23 12:56:03,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 12:56:03,660 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,663 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,664 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:56:03,664 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,664 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 12:56:03,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,669 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,669 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:56:03,670 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,670 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:56:03 BoogieIcfgContainer [2018-11-23 12:56:03,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:56:03,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:56:03,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:56:03,679 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:56:03,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:43" (3/4) ... [2018-11-23 12:56:03,682 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:56:03,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:56:03,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:56:03,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 12:56:03,694 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 12:56:03,694 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 12:56:03,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:56:03,752 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test25_true-unreach-call.c-witness.graphml [2018-11-23 12:56:03,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:56:03,755 INFO L168 Benchmark]: Toolchain (without parser) took 81350.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 858.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -218.5 MB). Peak memory consumption was 639.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:03,755 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:03,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:03,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:03,756 INFO L168 Benchmark]: Boogie Preprocessor took 35.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:03,757 INFO L168 Benchmark]: RCFGBuilder took 841.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:03,757 INFO L168 Benchmark]: TraceAbstraction took 79962.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 518.5 MB). Peak memory consumption was 652.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:03,758 INFO L168 Benchmark]: Witness Printer took 74.09 ms. Allocated memory is still 2.4 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:03,760 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.19 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 400.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.89 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 841.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79962.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 518.5 MB). Peak memory consumption was 652.8 MB. Max. memory is 7.1 GB. * Witness Printer took 74.09 ms. Allocated memory is still 2.4 GB. Free memory is still 1.6 GB. There was no memory consumed. 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$.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$.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$.base * 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_$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_$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-23 12:56:03,766 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,767 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 12:56:03,767 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,768 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,768 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:56:03,768 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,769 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,769 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,769 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 12:56:03,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 12:56:03,770 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,771 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:56:03,771 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 12:56:03,771 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4) && !(#memory_$Pointer$[cont][cont] == cont)) && !(array == cont) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 && !(array == cont) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 79.8s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 60.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 59 SDslu, 702 SDs, 0 SdLazy, 429 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=9, 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.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 8 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 33 NumberOfFragments, 119 HoareAnnotationTreeSize, 19 FomulaSimplifications, 196 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 511 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 493 ConstructedInterpolants, 3 QuantifiedInterpolants, 47732 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 190/480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...