java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:09,516 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:09,518 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:09,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:09,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:09,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:09,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:09,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:09,537 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:09,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:09,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:09,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:09,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:09,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:09,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:09,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:09,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:09,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:09,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:09,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:09,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:09,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:09,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:09,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:09,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:09,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:09,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:09,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:09,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:09,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:09,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:09,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:09,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:09,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:09,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:09,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:09,563 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:09,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:09,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:09,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:09,579 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:09,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:09,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:09,580 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:09,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:09,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:09,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:09,582 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:09,582 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:09,582 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:09,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:09,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:09,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:09,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:09,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:09,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:09,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:09,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:09,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:09,584 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:09,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:09,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:09,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:09,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:09,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:09,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:09,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:09,645 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:09,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-11-23 13:04:09,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2b18a85/e6bf0de5d40f4dac9eb50996d0c1bbff/FLAG7afaa91d8 [2018-11-23 13:04:10,137 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:10,137 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-11-23 13:04:10,143 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2b18a85/e6bf0de5d40f4dac9eb50996d0c1bbff/FLAG7afaa91d8 [2018-11-23 13:04:10,510 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2b18a85/e6bf0de5d40f4dac9eb50996d0c1bbff [2018-11-23 13:04:10,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:10,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:10,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:10,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:10,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:10,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e369dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10, skipping insertion in model container [2018-11-23 13:04:10,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:10,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:10,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:10,865 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:10,899 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:10,934 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:10,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10 WrapperNode [2018-11-23 13:04:10,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:10,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:10,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:10,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:10,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:10,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:10,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:10,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:10,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:10,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:11,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:11,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... [2018-11-23 13:04:11,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:11,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:11,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:11,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:11,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:11,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:11,854 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:11,855 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:04:11,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:11 BoogieIcfgContainer [2018-11-23 13:04:11,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:11,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:11,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:11,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:11,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:10" (1/3) ... [2018-11-23 13:04:11,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55766fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:11, skipping insertion in model container [2018-11-23 13:04:11,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:10" (2/3) ... [2018-11-23 13:04:11,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55766fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:11, skipping insertion in model container [2018-11-23 13:04:11,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:11" (3/3) ... [2018-11-23 13:04:11,867 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_true-unreach-call_true-termination.i [2018-11-23 13:04:11,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:11,885 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:11,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:11,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:11,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:11,938 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:11,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:11,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:11,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:11,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:11,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:11,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:04:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:11,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:11,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:11,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:11,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2018-11-23 13:04:11,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:11,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:12,066 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:12,066 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:12,066 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:12,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:12,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:04:12,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 13:04:12,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:04:12,194 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #52#return; {27#true} is VALID [2018-11-23 13:04:12,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2018-11-23 13:04:12,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {27#true} is VALID [2018-11-23 13:04:12,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 13:04:12,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2018-11-23 13:04:12,205 INFO L256 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2018-11-23 13:04:12,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:04:12,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:04:12,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:04:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:12,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:12,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:12,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:12,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:12,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:12,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:12,438 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 13:04:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:12,639 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-11-23 13:04:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:12,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:04:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 13:04:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 13:04:12,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2018-11-23 13:04:13,035 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 13:04:13,047 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:04:13,047 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:04:13,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:04:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:04:13,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:13,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:04:13,104 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:04:13,104 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:04:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:13,107 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 13:04:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:04:13,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:13,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:13,108 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:04:13,109 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:04:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:13,112 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 13:04:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:04:13,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:13,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:13,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:13,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 13:04:13,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2018-11-23 13:04:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:13,119 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:04:13,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:04:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:13,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:13,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:13,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:13,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2018-11-23 13:04:13,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:13,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:13,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:13,137 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:13,137 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:13,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:13,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2018-11-23 13:04:13,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {177#true} is VALID [2018-11-23 13:04:13,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2018-11-23 13:04:13,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #52#return; {177#true} is VALID [2018-11-23 13:04:13,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret7 := main(); {177#true} is VALID [2018-11-23 13:04:13,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {197#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:13,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {178#false} is VALID [2018-11-23 13:04:13,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {178#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {178#false} is VALID [2018-11-23 13:04:13,267 INFO L256 TraceCheckUtils]: 8: Hoare triple {178#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {178#false} is VALID [2018-11-23 13:04:13,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2018-11-23 13:04:13,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {178#false} assume 0 == ~cond; {178#false} is VALID [2018-11-23 13:04:13,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {178#false} assume !false; {178#false} is VALID [2018-11-23 13:04:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:13,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:13,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:13,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:13,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:13,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:13,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:13,320 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-11-23 13:04:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:13,823 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:04:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:13,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:04:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:04:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:04:13,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 13:04:14,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:14,086 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:04:14,086 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:04:14,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:04:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-23 13:04:14,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:14,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 18 states. [2018-11-23 13:04:14,132 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 18 states. [2018-11-23 13:04:14,132 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 18 states. [2018-11-23 13:04:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:14,135 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:04:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:04:14,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:14,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:14,136 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states. [2018-11-23 13:04:14,136 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states. [2018-11-23 13:04:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:14,139 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:04:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:04:14,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:14,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:14,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:14,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 13:04:14,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2018-11-23 13:04:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 13:04:14,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:04:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:04:14,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:14,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:14,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:14,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2018-11-23 13:04:14,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:14,153 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:14,154 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:14,154 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:14,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:14,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:14,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2018-11-23 13:04:14,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {326#true} is VALID [2018-11-23 13:04:14,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2018-11-23 13:04:14,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #52#return; {326#true} is VALID [2018-11-23 13:04:14,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret7 := main(); {326#true} is VALID [2018-11-23 13:04:14,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {346#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:14,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {346#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {350#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:14,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {327#false} is VALID [2018-11-23 13:04:14,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {327#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {327#false} is VALID [2018-11-23 13:04:14,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {327#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {327#false} is VALID [2018-11-23 13:04:14,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {327#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {327#false} is VALID [2018-11-23 13:04:14,339 INFO L256 TraceCheckUtils]: 11: Hoare triple {327#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {327#false} is VALID [2018-11-23 13:04:14,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2018-11-23 13:04:14,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2018-11-23 13:04:14,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2018-11-23 13:04:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:14,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:04:14,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:04:14,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:14,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:04:14,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:04:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:04:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:04:14,387 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2018-11-23 13:04:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:14,632 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 13:04:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:14,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:04:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 13:04:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 13:04:14,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2018-11-23 13:04:14,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:14,746 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:04:14,746 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:04:14,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:04:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-11-23 13:04:14,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:14,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 19 states. [2018-11-23 13:04:14,768 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 19 states. [2018-11-23 13:04:14,768 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 19 states. [2018-11-23 13:04:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:14,770 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 13:04:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 13:04:14,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:14,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:14,772 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 25 states. [2018-11-23 13:04:14,772 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 25 states. [2018-11-23 13:04:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:14,774 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 13:04:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 13:04:14,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:14,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:14,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:14,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 13:04:14,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 13:04:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:14,777 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 13:04:14,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:04:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 13:04:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:14,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:14,779 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 13:04:14,779 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:14,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2018-11-23 13:04:14,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:14,788 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:14,788 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:14,788 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:14,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:14,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:17,128 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:04:17,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:17,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 13:04:17,820 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 24 treesize of output 23 [2018-11-23 13:04:17,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:17,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:17,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:17,843 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:477, output treesize:13 [2018-11-23 13:04:18,560 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:18,561 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_13, v_prenex_14, v_prenex_11, v_prenex_12, v_prenex_5, v_prenex_6, |v_#memory_int_7|, |v_main_#t~nondet3_3|, v_prenex_3, v_prenex_4, v_prenex_9, v_prenex_10, v_prenex_7, v_prenex_8, v_prenex_1, v_prenex_2]. (let ((.cse21 (mod main_~N_LIN~0 4294967296))) (let ((.cse19 (* 4 .cse21)) (.cse18 (mod main_~j~0 4294967296)) (.cse20 (mod main_~k~0 4294967296))) (let ((.cse1 (* 4 .cse20)) (.cse7 (<= .cse18 2147483647)) (.cse14 (<= .cse21 2147483647)) (.cse8 (<= .cse20 2147483647)) (.cse16 (+ .cse18 (- 4294967296))) (.cse17 (+ .cse19 (- 17179869184)))) (let ((.cse0 (+ |main_~#matriz~0.offset| (* .cse18 .cse17))) (.cse13 (+ |main_~#matriz~0.offset| (* .cse16 .cse19))) (.cse15 (+ |main_~#matriz~0.offset| (* .cse18 .cse19))) (.cse11 (not .cse8)) (.cse2 (not .cse14)) (.cse9 (not .cse7)) (.cse10 (+ |main_~#matriz~0.offset| (* .cse16 .cse17))) (.cse12 (+ .cse1 (- 17179869184))) (.cse3 (= main_~k~0 0)) (.cse4 (= 1 main_~N_COL~0)) (.cse5 (= main_~j~0 0)) (.cse6 (= 1 main_~N_LIN~0))) (or (and (= (store v_prenex_13 |main_~#matriz~0.base| (store (select v_prenex_13 |main_~#matriz~0.base|) (+ .cse0 .cse1) v_prenex_14)) |#memory_int|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse8 (= (store v_prenex_11 |main_~#matriz~0.base| (store (select v_prenex_11 |main_~#matriz~0.base|) (+ .cse10 .cse1) v_prenex_12)) |#memory_int|)) (and .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (store v_prenex_5 |main_~#matriz~0.base| (store (select v_prenex_5 |main_~#matriz~0.base|) (+ .cse0 .cse12) v_prenex_6)) |#memory_int|)) (and .cse11 (= |#memory_int| (store |v_#memory_int_7| |main_~#matriz~0.base| (store (select |v_#memory_int_7| |main_~#matriz~0.base|) (+ .cse13 .cse12) |v_main_#t~nondet3_3|))) .cse9 .cse14 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse14 .cse3 .cse4 .cse5 .cse6 (= |#memory_int| (store v_prenex_3 |main_~#matriz~0.base| (store (select v_prenex_3 |main_~#matriz~0.base|) (+ .cse15 .cse12) v_prenex_4))) .cse7) (and .cse9 .cse14 .cse3 .cse4 .cse5 .cse6 (= (store v_prenex_9 |main_~#matriz~0.base| (store (select v_prenex_9 |main_~#matriz~0.base|) (+ .cse13 .cse1) v_prenex_10)) |#memory_int|) .cse8) (and (= (store v_prenex_7 |main_~#matriz~0.base| (store (select v_prenex_7 |main_~#matriz~0.base|) (+ .cse15 .cse1) v_prenex_8)) |#memory_int|) .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse11 .cse2 .cse9 (= (store v_prenex_1 |main_~#matriz~0.base| (store (select v_prenex_1 |main_~#matriz~0.base|) (+ .cse10 .cse12) v_prenex_2)) |#memory_int|) .cse3 .cse4 .cse5 .cse6)))))) [2018-11-23 13:04:18,562 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0)) [2018-11-23 13:04:18,838 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 15 treesize of output 11 [2018-11-23 13:04:18,846 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 11 treesize of output 7 [2018-11-23 13:04:18,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:18,859 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 13:04:18,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:04:18,863 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:18,863 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= .cse0 main_~maior~0) (<= |main_#t~mem6| .cse0))) [2018-11-23 13:04:18,864 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2018-11-23 13:04:18,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {506#true} call ULTIMATE.init(); {506#true} is VALID [2018-11-23 13:04:18,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {506#true} is VALID [2018-11-23 13:04:18,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {506#true} assume true; {506#true} is VALID [2018-11-23 13:04:18,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {506#true} {506#true} #52#return; {506#true} is VALID [2018-11-23 13:04:18,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {506#true} call #t~ret7 := main(); {506#true} is VALID [2018-11-23 13:04:18,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {506#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {526#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:18,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {526#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {530#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:18,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {530#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {530#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:18,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {530#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {537#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)) (* 4 (mod main_~k~0 4294967296)))) main_~maior~0))} is VALID [2018-11-23 13:04:18,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {537#(and (= main_~k~0 0) (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)) (* 4 (mod main_~k~0 4294967296)))) main_~maior~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {541#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)))) main_~maior~0))} is VALID [2018-11-23 13:04:18,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)))) main_~maior~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {541#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)))) main_~maior~0))} is VALID [2018-11-23 13:04:18,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)))) main_~maior~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {548#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_COL~0) (= main_~j~0 1))} is VALID [2018-11-23 13:04:18,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {548#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_COL~0) (= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {552#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2018-11-23 13:04:18,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {552#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {556#(<= |main_#t~mem6| main_~maior~0)} is VALID [2018-11-23 13:04:18,931 INFO L256 TraceCheckUtils]: 14: Hoare triple {556#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {560#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:18,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {560#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {564#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:18,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {507#false} is VALID [2018-11-23 13:04:18,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {507#false} assume !false; {507#false} is VALID [2018-11-23 13:04:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:18,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:18,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 13:04:18,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:04:18,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:18,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:04:18,980 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 13:04:18,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:04:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:04:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:18,981 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 11 states. [2018-11-23 13:04:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:19,800 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:04:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:19,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:04:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-11-23 13:04:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-11-23 13:04:19,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2018-11-23 13:04:19,924 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 13:04:19,926 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:04:19,926 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:04:19,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:04:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:04:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-23 13:04:19,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:19,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 22 states. [2018-11-23 13:04:19,972 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 22 states. [2018-11-23 13:04:19,973 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 22 states. [2018-11-23 13:04:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:19,975 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 13:04:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 13:04:19,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:19,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 27 states. [2018-11-23 13:04:19,976 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 27 states. [2018-11-23 13:04:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:19,979 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 13:04:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 13:04:19,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:19,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:19,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:19,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:04:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 13:04:19,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2018-11-23 13:04:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:19,982 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 13:04:19,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:04:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:04:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:19,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:19,984 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 13:04:19,984 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:19,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2018-11-23 13:04:19,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:19,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:19,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:19,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:19,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:19,992 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:19,992 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:20,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:20,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:20,288 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:04:20,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 13:04:20,367 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 14 treesize of output 13 [2018-11-23 13:04:20,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:17 [2018-11-23 13:04:20,387 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:20,388 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, |v_main_#t~nondet3_4|, v_prenex_16, v_prenex_15]. (let ((.cse6 (mod main_~k~0 4294967296))) (let ((.cse3 (= main_~k~0 0)) (.cse0 (<= .cse6 2147483647)) (.cse1 (select |#memory_int| |main_~#matriz~0.base|)) (.cse4 (* 4 .cse6))) (or (let ((.cse2 (+ |main_~#matriz~0.offset| .cse4 (- 17179869184)))) (and (not .cse0) (<= (select .cse1 .cse2) |main_#t~mem4|) .cse3 (= |#memory_int| (store |v_#memory_int_8| |main_~#matriz~0.base| (store (select |v_#memory_int_8| |main_~#matriz~0.base|) .cse2 |v_main_#t~nondet3_4|))))) (let ((.cse5 (+ |main_~#matriz~0.offset| .cse4))) (and (= (store v_prenex_16 |main_~#matriz~0.base| (store (select v_prenex_16 |main_~#matriz~0.base|) .cse5 v_prenex_15)) |#memory_int|) .cse3 .cse0 (<= (select .cse1 .cse5) |main_#t~mem4|)))))) [2018-11-23 13:04:20,388 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~k~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~k~0 4294967296)))) |main_#t~mem4|)) [2018-11-23 13:04:20,468 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 13:04:20,474 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 13:04:20,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:20,496 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 13:04:20,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 13:04:20,498 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:20,498 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= |main_#t~mem6| .cse0) (<= (+ .cse0 1) main_~maior~0))) [2018-11-23 13:04:20,498 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem6| 1) main_~maior~0) [2018-11-23 13:04:20,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 13:04:20,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {728#true} is VALID [2018-11-23 13:04:20,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 13:04:20,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #52#return; {728#true} is VALID [2018-11-23 13:04:20,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret7 := main(); {728#true} is VALID [2018-11-23 13:04:20,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {748#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:20,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {748#(and (= 1 main_~N_COL~0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {752#(and (= main_~k~0 0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:20,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {752#(and (= main_~k~0 0) (= main_~j~0 0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {756#(and (= main_~k~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~k~0 4294967296)))) |main_#t~mem4|))} is VALID [2018-11-23 13:04:20,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {756#(and (= main_~k~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~k~0 4294967296)))) |main_#t~mem4|))} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {760#(and (= main_~k~0 0) (<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~k~0 4294967296)))) 1) main_~maior~0))} is VALID [2018-11-23 13:04:20,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {760#(and (= main_~k~0 0) (<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~k~0 4294967296)))) 1) main_~maior~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2018-11-23 13:04:20,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2018-11-23 13:04:20,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2018-11-23 13:04:20,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2018-11-23 13:04:20,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {764#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {777#(<= (+ |main_#t~mem6| 1) main_~maior~0)} is VALID [2018-11-23 13:04:20,605 INFO L256 TraceCheckUtils]: 14: Hoare triple {777#(<= (+ |main_#t~mem6| 1) main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {781#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:20,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {781#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {785#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:20,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {729#false} is VALID [2018-11-23 13:04:20,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 13:04:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 13:04:20,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:04:20,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:20,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:04:20,672 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 13:04:20,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:20,673 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 10 states. [2018-11-23 13:04:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:21,568 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 13:04:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:04:21,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:04:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2018-11-23 13:04:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2018-11-23 13:04:21,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2018-11-23 13:04:21,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:21,651 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:04:21,651 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:04:21,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:04:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:04:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-23 13:04:21,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:21,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 26 states. [2018-11-23 13:04:21,680 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 26 states. [2018-11-23 13:04:21,680 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 26 states. [2018-11-23 13:04:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:21,683 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:04:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:04:21,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:21,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:21,684 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 33 states. [2018-11-23 13:04:21,684 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 33 states. [2018-11-23 13:04:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:21,687 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:04:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:04:21,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:21,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:21,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:21,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:04:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 13:04:21,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2018-11-23 13:04:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:21,691 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 13:04:21,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 13:04:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:04:21,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:21,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:21,692 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:21,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -422232267, now seen corresponding path program 2 times [2018-11-23 13:04:21,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:21,701 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:21,702 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:21,702 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:21,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:21,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:21,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:21,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-23 13:04:21,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {970#true} is VALID [2018-11-23 13:04:21,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-23 13:04:21,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {970#true} {970#true} #52#return; {970#true} is VALID [2018-11-23 13:04:21,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {970#true} call #t~ret7 := main(); {970#true} is VALID [2018-11-23 13:04:21,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {990#(= 1 main_~N_LIN~0)} is VALID [2018-11-23 13:04:21,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {990#(= 1 main_~N_LIN~0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:21,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:21,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:21,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {994#(and (= main_~k~0 0) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1004#(and (= main_~k~0 1) (= 1 main_~N_LIN~0))} is VALID [2018-11-23 13:04:21,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {1004#(and (= main_~k~0 1) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {971#false} is VALID [2018-11-23 13:04:21,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {971#false} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {971#false} is VALID [2018-11-23 13:04:21,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {971#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {971#false} is VALID [2018-11-23 13:04:21,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {971#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {971#false} is VALID [2018-11-23 13:04:21,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {971#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {971#false} is VALID [2018-11-23 13:04:21,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {971#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {971#false} is VALID [2018-11-23 13:04:21,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {971#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {971#false} is VALID [2018-11-23 13:04:21,859 INFO L256 TraceCheckUtils]: 17: Hoare triple {971#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {971#false} is VALID [2018-11-23 13:04:21,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {971#false} ~cond := #in~cond; {971#false} is VALID [2018-11-23 13:04:21,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#false} assume 0 == ~cond; {971#false} is VALID [2018-11-23 13:04:21,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-23 13:04:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:21,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:21,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 13:04:21,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 13:04:21,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:21,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:21,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:21,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:21,932 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 13:04:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,052 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 13:04:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:22,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 13:04:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 13:04:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 13:04:22,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-23 13:04:22,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:22,197 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:04:22,197 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:04:22,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:04:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:04:22,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:22,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:22,232 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:22,233 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,235 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 13:04:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 13:04:22,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:22,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:22,236 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:22,237 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,238 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 13:04:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 13:04:22,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:22,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:22,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:22,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:04:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 13:04:22,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-23 13:04:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:22,241 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 13:04:22,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:04:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:22,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:22,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:22,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:22,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -781579443, now seen corresponding path program 1 times [2018-11-23 13:04:22,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:22,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:22,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:22,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:22,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:22,251 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:04:22,251 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:04:22,251 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:04:22,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:22,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:22,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-23 13:04:22,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-23 13:04:22,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-23 13:04:22,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #52#return; {1190#true} is VALID [2018-11-23 13:04:22,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret7 := main(); {1190#true} is VALID [2018-11-23 13:04:22,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:22,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {1210#(and (= 1 main_~N_COL~0) (= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1229#(and (= 1 main_~N_COL~0) (= main_~j~0 1))} is VALID [2018-11-23 13:04:22,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {1229#(and (= 1 main_~N_COL~0) (= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1191#false} is VALID [2018-11-23 13:04:22,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {1191#false} is VALID [2018-11-23 13:04:22,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1191#false} is VALID [2018-11-23 13:04:22,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1191#false} is VALID [2018-11-23 13:04:22,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1191#false} is VALID [2018-11-23 13:04:22,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1191#false} is VALID [2018-11-23 13:04:22,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1191#false} is VALID [2018-11-23 13:04:22,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1191#false} is VALID [2018-11-23 13:04:22,460 INFO L256 TraceCheckUtils]: 20: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1191#false} is VALID [2018-11-23 13:04:22,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-23 13:04:22,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2018-11-23 13:04:22,460 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-23 13:04:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:04:22,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:22,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 13:04:22,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 13:04:22,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:22,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:04:22,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:22,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:04:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:04:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:04:22,509 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2018-11-23 13:04:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,727 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:04:22,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:22,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 13:04:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-23 13:04:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-23 13:04:22,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2018-11-23 13:04:22,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:22,757 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:04:22,758 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:22,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:04:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:22,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:22,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:22,759 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:22,760 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,760 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:22,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:22,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:22,761 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:22,761 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:22,761 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:22,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:22,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:22,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:22,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:22,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-23 13:04:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:22,762 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:22,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:04:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:22,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:22,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:23,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:23,018 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:23,019 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:23,019 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:23,019 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:23,019 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:23,019 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:23,020 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2018-11-23 13:04:23,020 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2018-11-23 13:04:23,020 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0))) (or (and .cse0 (= main_~j~0 0) (= 1 main_~N_LIN~0)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 (= main_~j~0 1)))) [2018-11-23 13:04:23,020 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2018-11-23 13:04:23,021 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2018-11-23 13:04:23,021 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2018-11-23 13:04:23,021 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (or (and (<= (+ |main_#t~mem6| 1) main_~maior~0) (<= (+ .cse0 1) main_~maior~0)) (and (<= |main_#t~mem6| main_~maior~0) (<= .cse0 main_~maior~0) (= 1 main_~N_COL~0) (= main_~j~0 1)))) [2018-11-23 13:04:23,021 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-11-23 13:04:23,021 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= main_~j~0 0)) (.cse2 (= 1 main_~N_LIN~0))) (or (and (= main_~k~0 0) .cse0 .cse1 .cse2) (and (= main_~k~0 1) .cse0 .cse1 .cse2 (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* 4 (mod main_~j~0 4294967296)))) main_~maior~0)))) [2018-11-23 13:04:23,022 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:04:23,022 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:23,024 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:23,025 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:23,025 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:23,025 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:23,025 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:23,025 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:04:23,027 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:23,028 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:23,028 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 13:04:23,035 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,039 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,040 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,041 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:23 BoogieIcfgContainer [2018-11-23 13:04:23,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:23,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:23,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:23,044 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:23,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:11" (3/4) ... [2018-11-23 13:04:23,049 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:23,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:23,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:23,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:23,061 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:04:23,061 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 13:04:23,061 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:23,109 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/matrix_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:23,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:23,110 INFO L168 Benchmark]: Toolchain (without parser) took 12588.55 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 855.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.1 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:23,112 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:23,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:23,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:23,113 INFO L168 Benchmark]: Boogie Preprocessor took 41.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:23,114 INFO L168 Benchmark]: RCFGBuilder took 845.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:23,114 INFO L168 Benchmark]: TraceAbstraction took 11185.31 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 2.3 GB in the end (delta: -95.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:23,115 INFO L168 Benchmark]: Witness Printer took 65.43 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:23,119 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.23 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 412.38 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.88 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 41.93 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 845.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11185.31 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 2.3 GB in the end (delta: -95.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Witness Printer took 65.43 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant [2018-11-23 13:04:23,128 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,128 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((k == 0 && 1 == N_COL) && j == 0) && 1 == N_LIN) || ((((k == 1 && 1 == N_COL) && j == 0) && 1 == N_LIN) && unknown-#memory_int-unknown[matriz][matriz + 4 * (j % 4294967296)] <= maior) - InvariantResult [Line: 19]: Loop Invariant [2018-11-23 13:04:23,129 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:23,129 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((1 == N_COL && j == 0) && 1 == N_LIN) || ((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == N_COL) && j == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 55 SDslu, 229 SDs, 0 SdLazy, 278 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 25 NumberOfFragments, 103 HoareAnnotationTreeSize, 16 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 88 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 7362 SizeOfPredicates, 30 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 17/23 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...