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/array-multidimensional/add-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:33:26,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:33:26,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:33:26,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:33:26,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:33:26,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:33:27,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:33:27,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:33:27,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:33:27,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:33:27,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:33:27,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:33:27,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:33:27,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:33:27,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:33:27,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:33:27,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:33:27,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:33:27,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:33:27,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:33:27,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:33:27,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:33:27,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:33:27,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:33:27,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:33:27,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:33:27,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:33:27,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:33:27,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:33:27,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:33:27,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:33:27,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:33:27,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:33:27,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:33:27,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:33:27,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:33:27,029 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:33:27,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:33:27,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:33:27,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:33:27,045 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:33:27,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:33:27,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:33:27,046 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:33:27,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:33:27,047 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:33:27,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:33:27,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:33:27,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:33:27,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:33:27,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:33:27,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:33:27,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:33:27,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:33:27,048 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:33:27,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:33:27,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:33:27,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:33:27,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:33:27,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:33:27,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:27,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:33:27,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:33:27,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:33:27,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:33:27,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:33:27,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:33:27,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:33:27,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:33:27,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:33:27,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:33:27,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:33:27,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:33:27,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/add-3-n-u_true-unreach-call.i [2018-11-23 12:33:27,200 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e839f9d/84c79e742def4afba53b09f21482febf/FLAGc48f86c97 [2018-11-23 12:33:27,663 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:33:27,664 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/add-3-n-u_true-unreach-call.i [2018-11-23 12:33:27,671 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e839f9d/84c79e742def4afba53b09f21482febf/FLAGc48f86c97 [2018-11-23 12:33:28,033 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e839f9d/84c79e742def4afba53b09f21482febf [2018-11-23 12:33:28,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:33:28,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:33:28,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:28,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:33:28,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:33:28,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9befe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28, skipping insertion in model container [2018-11-23 12:33:28,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:33:28,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:33:28,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:28,391 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:33:28,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:28,453 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:33:28,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28 WrapperNode [2018-11-23 12:33:28,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:28,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:28,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:33:28,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:33:28,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:28,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:33:28,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:33:28,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:33:28,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... [2018-11-23 12:33:28,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:33:28,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:33:28,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:33:28,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:33:28,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:33:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:33:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:33:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:33:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:33:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:33:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:33:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:33:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:33:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:33:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:33:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:33:29,617 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:33:29,617 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:33:29,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:29 BoogieIcfgContainer [2018-11-23 12:33:29,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:33:29,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:33:29,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:33:29,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:33:29,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:28" (1/3) ... [2018-11-23 12:33:29,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cd6fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:29, skipping insertion in model container [2018-11-23 12:33:29,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:28" (2/3) ... [2018-11-23 12:33:29,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cd6fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:29, skipping insertion in model container [2018-11-23 12:33:29,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:29" (3/3) ... [2018-11-23 12:33:29,627 INFO L112 eAbstractionObserver]: Analyzing ICFG add-3-n-u_true-unreach-call.i [2018-11-23 12:33:29,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:33:29,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:33:29,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:33:29,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:33:29,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:33:29,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:33:29,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:33:29,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:33:29,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:33:29,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:33:29,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:33:29,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:33:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:33:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:29,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:29,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:29,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:29,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1773460249, now seen corresponding path program 1 times [2018-11-23 12:33:29,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:29,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:29,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:29,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:29,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:29,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:29,840 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 12:33:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:29,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:29,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:33:29,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:33:29,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:33:29,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #138#return; {39#true} is VALID [2018-11-23 12:33:29,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-23 12:33:29,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-23 12:33:29,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:33:29,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:29,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:33:29,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:29,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:29,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:29,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {40#false} is VALID [2018-11-23 12:33:29,991 INFO L256 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {40#false} is VALID [2018-11-23 12:33:29,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 12:33:29,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 12:33:29,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:33:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:30,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:30,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:33:30,023 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:30,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:30,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:33:30,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:33:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:33:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:33:30,098 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:33:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:30,574 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2018-11-23 12:33:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:33:30,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:30,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2018-11-23 12:33:31,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:31,200 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:33:31,200 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:33:31,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:33:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:33:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:33:31,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:31,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:31,342 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:31,342 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:31,347 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:31,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:31,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:31,348 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:31,348 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:31,353 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:31,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:31,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:31,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:31,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:33:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 12:33:31,359 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2018-11-23 12:33:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:31,365 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 12:33:31,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:33:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:31,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:31,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:31,367 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:31,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1763514787, now seen corresponding path program 1 times [2018-11-23 12:33:31,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:31,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:31,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:31,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:31,382 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:31,383 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:31,384 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 12:33:31,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:31,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:31,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 12:33:31,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-23 12:33:31,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 12:33:31,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #138#return; {291#true} is VALID [2018-11-23 12:33:31,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret7 := main(); {291#true} is VALID [2018-11-23 12:33:31,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:31,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:33:31,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:31,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:33:31,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:31,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:31,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:31,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {292#false} is VALID [2018-11-23 12:33:31,866 INFO L256 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {292#false} is VALID [2018-11-23 12:33:31,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 12:33:31,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2018-11-23 12:33:31,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 12:33:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:33:31,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:31,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:31,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:33:31,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:31,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:33:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:33:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:31,935 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-11-23 12:33:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:32,211 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-23 12:33:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:33:32,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:32,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:33:32,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:32,399 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:33:32,399 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:33:32,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:33:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:33:32,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:32,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:32,458 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:32,458 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:32,461 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:32,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:32,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:32,464 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:32,464 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:32,467 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:32,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:32,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:32,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:32,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:33:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:33:32,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:33:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:32,472 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:33:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:33:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:33:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:33:32,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:32,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:32,474 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:32,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2133227694, now seen corresponding path program 1 times [2018-11-23 12:33:32,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:32,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:32,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:32,483 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:32,483 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:32,483 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 12:33:32,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:32,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:32,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-23 12:33:32,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {546#true} is VALID [2018-11-23 12:33:32,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-23 12:33:32,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #138#return; {546#true} is VALID [2018-11-23 12:33:32,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret7 := main(); {546#true} is VALID [2018-11-23 12:33:32,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {566#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:32,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:32,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {547#false} is VALID [2018-11-23 12:33:32,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#false} ~i~0 := 1 + ~i~0; {547#false} is VALID [2018-11-23 12:33:32,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:33:32,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:32,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:33:32,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:32,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:32,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:32,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {547#false} is VALID [2018-11-23 12:33:32,680 INFO L256 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {547#false} is VALID [2018-11-23 12:33:32,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2018-11-23 12:33:32,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2018-11-23 12:33:32,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-23 12:33:32,682 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 12:33:32,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:32,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:32,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:32,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:32,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:32,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:32,759 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:33:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:33,033 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-23 12:33:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:33,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:33:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:33:33,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-23 12:33:33,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:33,182 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:33:33,182 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:33:33,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:33:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:33:33,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:33,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:33,248 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:33,248 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:33:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:33,253 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:33,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:33,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:33,254 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:33:33,254 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:33:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:33,257 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:33:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:33:33,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:33,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:33,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:33,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:33:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 12:33:33,261 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2018-11-23 12:33:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:33,262 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 12:33:33,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:33:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:33:33,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:33,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:33,264 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:33,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1108398309, now seen corresponding path program 1 times [2018-11-23 12:33:33,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:33,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:33,272 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:33,272 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:33,273 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 12:33:33,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:33,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:33,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-23 12:33:33,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-23 12:33:33,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-23 12:33:33,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #138#return; {862#true} is VALID [2018-11-23 12:33:33,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret7 := main(); {862#true} is VALID [2018-11-23 12:33:33,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:33,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:33,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:33,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {863#false} is VALID [2018-11-23 12:33:33,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#false} ~j~0 := 1 + ~j~0; {863#false} is VALID [2018-11-23 12:33:33,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#false} assume !(~j~0 < ~n~0); {863#false} is VALID [2018-11-23 12:33:33,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#false} ~i~0 := 1 + ~i~0; {863#false} is VALID [2018-11-23 12:33:33,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:33:33,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:33,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:33:33,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:33,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {863#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:33,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {863#false} is VALID [2018-11-23 12:33:33,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {863#false} is VALID [2018-11-23 12:33:33,569 INFO L256 TraceCheckUtils]: 19: Hoare triple {863#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {863#false} is VALID [2018-11-23 12:33:33,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#false} ~cond := #in~cond; {863#false} is VALID [2018-11-23 12:33:33,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {863#false} assume 0 == ~cond; {863#false} is VALID [2018-11-23 12:33:33,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-23 12:33:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:33,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:33,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:33,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:33,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:33,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:33,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:33,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:33,626 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2018-11-23 12:33:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:33,967 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 12:33:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:33,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:33:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:33:33,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2018-11-23 12:33:34,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:34,079 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:33:34,079 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:33:34,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:33:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-23 12:33:34,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:34,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:34,170 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:34,170 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2018-11-23 12:33:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:34,173 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:33:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:33:34,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:34,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:34,175 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2018-11-23 12:33:34,175 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2018-11-23 12:33:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:34,179 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:33:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:33:34,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:34,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:34,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:34,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:33:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:33:34,183 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 23 [2018-11-23 12:33:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:34,183 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:33:34,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:33:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:33:34,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:34,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:34,185 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:34,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1602833213, now seen corresponding path program 1 times [2018-11-23 12:33:34,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:34,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:34,193 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:34,193 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:34,194 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 12:33:34,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:34,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:34,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-23 12:33:34,405 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 12:33:34,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-23 12:33:34,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #138#return; {1190#true} is VALID [2018-11-23 12:33:34,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret7 := main(); {1190#true} is VALID [2018-11-23 12:33:34,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:34,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:34,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1217#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:34,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:34,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1191#false} is VALID [2018-11-23 12:33:34,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {1191#false} ~j~0 := 1 + ~j~0; {1191#false} is VALID [2018-11-23 12:33:34,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} assume !(~j~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:33:34,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} ~i~0 := 1 + ~i~0; {1191#false} is VALID [2018-11-23 12:33:34,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:33:34,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:34,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:33:34,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:34,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:34,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1191#false} is VALID [2018-11-23 12:33:34,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1191#false} is VALID [2018-11-23 12:33:34,414 INFO L256 TraceCheckUtils]: 20: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1191#false} is VALID [2018-11-23 12:33:34,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-23 12:33:34,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2018-11-23 12:33:34,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-23 12:33:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:34,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:34,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:34,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:34,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:34,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:34,488 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 12:33:34,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:34,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:34,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:34,490 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:33:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:34,816 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:33:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:34,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:33:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:33:34,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:33:35,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:35,022 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:33:35,022 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:33:35,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:33:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-23 12:33:35,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:35,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:35,118 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:35,118 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 43 states. [2018-11-23 12:33:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:35,121 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:33:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:33:35,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:35,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:35,123 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 48 states. [2018-11-23 12:33:35,123 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 48 states. [2018-11-23 12:33:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:35,126 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:33:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:33:35,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:35,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:35,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:35,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:33:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:33:35,130 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2018-11-23 12:33:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:35,131 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:33:35,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:33:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:33:35,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:35,132 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:35,132 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:35,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 249553947, now seen corresponding path program 2 times [2018-11-23 12:33:35,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:35,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:35,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:35,141 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:35,141 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:35,141 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 12:33:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:35,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:33:35,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:35,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:35,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2018-11-23 12:33:35,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1556#true} is VALID [2018-11-23 12:33:35,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2018-11-23 12:33:35,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #138#return; {1556#true} is VALID [2018-11-23 12:33:35,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret7 := main(); {1556#true} is VALID [2018-11-23 12:33:35,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {1556#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {1576#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:35,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:35,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1557#false} is VALID [2018-11-23 12:33:35,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {1557#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:35,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:35,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1557#false} is VALID [2018-11-23 12:33:35,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1557#false} is VALID [2018-11-23 12:33:35,372 INFO L256 TraceCheckUtils]: 21: Hoare triple {1557#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1557#false} is VALID [2018-11-23 12:33:35,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {1557#false} ~cond := #in~cond; {1557#false} is VALID [2018-11-23 12:33:35,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {1557#false} assume 0 == ~cond; {1557#false} is VALID [2018-11-23 12:33:35,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2018-11-23 12:33:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:33:35,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:35,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:35,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:35,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:35,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:35,445 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 12:33:35,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:35,446 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2018-11-23 12:33:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:35,924 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 12:33:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:35,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:35,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-23 12:33:36,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:36,046 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:33:36,047 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:33:36,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:33:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2018-11-23 12:33:36,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:36,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:36,148 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:36,149 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 44 states. [2018-11-23 12:33:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:36,153 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:33:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:33:36,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:36,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:36,155 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 70 states. [2018-11-23 12:33:36,155 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 70 states. [2018-11-23 12:33:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:36,159 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:33:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:33:36,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:36,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:36,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:36,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:33:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:33:36,163 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 25 [2018-11-23 12:33:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:36,163 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:33:36,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:33:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:33:36,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:36,164 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:36,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:36,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1698801625, now seen corresponding path program 1 times [2018-11-23 12:33:36,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:36,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:36,173 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:36,173 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:36,173 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 12:33:36,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:36,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:36,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2018-11-23 12:33:36,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1988#true} is VALID [2018-11-23 12:33:36,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2018-11-23 12:33:36,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #138#return; {1988#true} is VALID [2018-11-23 12:33:36,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret7 := main(); {1988#true} is VALID [2018-11-23 12:33:36,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {1988#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:36,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:36,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2015#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:36,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {2015#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2019#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:36,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {2019#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:33:36,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:33:36,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:33:36,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:33:36,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:33:36,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:33:36,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:33:36,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:33:36,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#false} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:33:36,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:33:36,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:33:36,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:33:36,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:33:36,583 INFO L273 TraceCheckUtils]: 25: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:33:36,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1989#false} is VALID [2018-11-23 12:33:36,584 INFO L256 TraceCheckUtils]: 29: Hoare triple {1989#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1989#false} is VALID [2018-11-23 12:33:36,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2018-11-23 12:33:36,585 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2018-11-23 12:33:36,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2018-11-23 12:33:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:33:36,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:36,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:33:36,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:33:36,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:36,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:33:36,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:33:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:33:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:36,743 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 12:33:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:37,603 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2018-11-23 12:33:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:33:37,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:33:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:33:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:33:37,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 12:33:37,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:37,724 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:33:37,724 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:33:37,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:33:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 12:33:38,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:38,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:38,141 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:38,141 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 12:33:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:38,144 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:38,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:38,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:38,145 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 12:33:38,145 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 12:33:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:38,148 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:38,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:38,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:38,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:38,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:33:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-23 12:33:38,151 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 33 [2018-11-23 12:33:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-23 12:33:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:33:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:33:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:33:38,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:38,152 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:38,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -602786922, now seen corresponding path program 2 times [2018-11-23 12:33:38,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:38,161 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:38,161 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:38,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:38,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:38,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:33:38,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:38,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:38,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2018-11-23 12:33:38,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {2420#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2420#true} is VALID [2018-11-23 12:33:38,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2018-11-23 12:33:38,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #138#return; {2420#true} is VALID [2018-11-23 12:33:38,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret7 := main(); {2420#true} is VALID [2018-11-23 12:33:38,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:38,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:33:38,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2447#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:38,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {2447#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2451#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:38,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {2451#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2455#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:33:38,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:33:38,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:33:38,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:33:38,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:33:38,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:33:38,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:33:38,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:38,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:38,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:33:38,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {2421#false} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:33:38,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:33:38,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:33:38,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:33:38,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:33:38,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:33:38,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2421#false} is VALID [2018-11-23 12:33:38,589 INFO L256 TraceCheckUtils]: 31: Hoare triple {2421#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2421#false} is VALID [2018-11-23 12:33:38,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {2421#false} ~cond := #in~cond; {2421#false} is VALID [2018-11-23 12:33:38,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {2421#false} assume 0 == ~cond; {2421#false} is VALID [2018-11-23 12:33:38,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2018-11-23 12:33:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:33:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:38,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:33:38,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:33:38,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:38,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:33:38,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:38,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:33:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:33:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:38,650 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 7 states. [2018-11-23 12:33:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:39,095 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-23 12:33:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:33:39,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:33:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:33:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:33:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:33:39,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-23 12:33:39,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:39,230 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:33:39,230 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:33:39,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:33:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:33:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-23 12:33:39,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:39,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:39,379 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:39,379 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-23 12:33:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:39,382 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:33:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:33:39,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:39,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:39,383 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-23 12:33:39,383 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-23 12:33:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:39,385 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:33:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:33:39,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:39,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:39,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:39,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:33:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-23 12:33:39,389 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 35 [2018-11-23 12:33:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:39,389 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 12:33:39,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:33:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:33:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:33:39,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:39,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:39,390 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:39,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash -119527047, now seen corresponding path program 3 times [2018-11-23 12:33:39,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:39,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:39,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:39,397 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:39,397 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:39,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:39,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:33:39,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:33:39,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:39,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:39,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {2896#true} call ULTIMATE.init(); {2896#true} is VALID [2018-11-23 12:33:39,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {2896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2896#true} is VALID [2018-11-23 12:33:39,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {2896#true} assume true; {2896#true} is VALID [2018-11-23 12:33:39,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2896#true} {2896#true} #138#return; {2896#true} is VALID [2018-11-23 12:33:39,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {2896#true} call #t~ret7 := main(); {2896#true} is VALID [2018-11-23 12:33:39,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {2896#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {2916#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:39,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := 1 + ~j~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:39,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2897#false} is VALID [2018-11-23 12:33:39,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {2897#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:39,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {2897#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:39,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {2897#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2897#false} is VALID [2018-11-23 12:33:39,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {2897#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2897#false} is VALID [2018-11-23 12:33:39,656 INFO L256 TraceCheckUtils]: 33: Hoare triple {2897#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2897#false} is VALID [2018-11-23 12:33:39,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {2897#false} ~cond := #in~cond; {2897#false} is VALID [2018-11-23 12:33:39,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {2897#false} assume 0 == ~cond; {2897#false} is VALID [2018-11-23 12:33:39,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {2897#false} assume !false; {2897#false} is VALID [2018-11-23 12:33:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:33:39,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:39,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:33:39,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:39,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:39,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:39,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:39,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:39,848 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-11-23 12:33:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:40,485 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2018-11-23 12:33:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:40,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:33:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:33:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:33:40,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2018-11-23 12:33:40,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:40,619 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:33:40,619 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:33:40,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:33:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2018-11-23 12:33:41,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:41,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:41,043 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:41,043 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 74 states. [2018-11-23 12:33:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:41,049 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:33:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:33:41,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:41,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:41,050 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 128 states. [2018-11-23 12:33:41,050 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 128 states. [2018-11-23 12:33:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:41,054 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:33:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:33:41,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:41,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:41,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:41,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:33:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-23 12:33:41,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 37 [2018-11-23 12:33:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:41,058 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-23 12:33:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-23 12:33:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:33:41,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:41,059 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:41,059 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:41,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1459343723, now seen corresponding path program 4 times [2018-11-23 12:33:41,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:41,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:41,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:41,065 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:41,066 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:41,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:13,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:13,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:13,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:13,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {3668#true} call ULTIMATE.init(); {3668#true} is VALID [2018-11-23 12:34:13,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {3668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3668#true} is VALID [2018-11-23 12:34:13,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {3668#true} assume true; {3668#true} is VALID [2018-11-23 12:34:13,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3668#true} {3668#true} #138#return; {3668#true} is VALID [2018-11-23 12:34:13,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {3668#true} call #t~ret7 := main(); {3668#true} is VALID [2018-11-23 12:34:13,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {3668#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3688#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:13,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {3688#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3688#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:13,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {3688#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3695#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:13,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3699#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:13,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {3699#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3703#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:13,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {3703#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3707#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:13,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {3707#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3711#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:13,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {3711#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:13,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:13,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:13,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:13,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:13,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:13,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:13,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:13,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:34:13,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 45: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:13,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:13,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3669#false} is VALID [2018-11-23 12:34:13,342 INFO L256 TraceCheckUtils]: 53: Hoare triple {3669#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {3669#false} is VALID [2018-11-23 12:34:13,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {3669#false} ~cond := #in~cond; {3669#false} is VALID [2018-11-23 12:34:13,342 INFO L273 TraceCheckUtils]: 55: Hoare triple {3669#false} assume 0 == ~cond; {3669#false} is VALID [2018-11-23 12:34:13,342 INFO L273 TraceCheckUtils]: 56: Hoare triple {3669#false} assume !false; {3669#false} is VALID [2018-11-23 12:34:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 12:34:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:13,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-23 12:34:13,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:13,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:13,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:13,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:13,473 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 8 states. [2018-11-23 12:34:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,461 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2018-11-23 12:34:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:14,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-23 12:34:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:14,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 111 transitions. [2018-11-23 12:34:14,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,644 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:34:14,644 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:34:14,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:34:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-11-23 12:34:15,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:15,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:15,029 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:15,029 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,032 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-23 12:34:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-23 12:34:15,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 84 states. [2018-11-23 12:34:15,033 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 84 states. [2018-11-23 12:34:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,035 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-23 12:34:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-23 12:34:15,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:15,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:34:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2018-11-23 12:34:15,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 57 [2018-11-23 12:34:15,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:15,039 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-11-23 12:34:15,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-11-23 12:34:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:34:15,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:15,040 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:15,041 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:15,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:15,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1598561597, now seen corresponding path program 5 times [2018-11-23 12:34:15,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:15,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:15,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,048 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:15,049 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:15,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:15,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1