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/copy-partial-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:33:49,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:33:49,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:33:49,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:33:49,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:33:49,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:33:49,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:33:49,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:33:49,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:33:49,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:33:49,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:33:49,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:33:49,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:33:49,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:33:49,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:33:49,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:33:49,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:33:49,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:33:49,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:33:49,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:33:49,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:33:49,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:33:49,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:33:49,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:33:49,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:33:49,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:33:49,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:33:49,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:33:49,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:33:49,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:33:49,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:33:49,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:33:49,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:33:49,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:33:49,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:33:49,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:33:49,212 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:49,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:33:49,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:33:49,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:33:49,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:33:49,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:33:49,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:33:49,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:33:49,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:33:49,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:33:49,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:33:49,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:33:49,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:33:49,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:33:49,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:33:49,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:33:49,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:33:49,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:33:49,250 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:33:49,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:33:49,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:33:49,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:33:49,251 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:33:49,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:33:49,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:49,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:33:49,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:33:49,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:33:49,252 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:33:49,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:33:49,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:33:49,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:33:49,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:33:49,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:33:49,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:33:49,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:33:49,320 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:33:49,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i [2018-11-23 12:33:49,384 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161e3615/88c2437c295a4bf6ab5e11853ecf265c/FLAG1e16fb910 [2018-11-23 12:33:49,883 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:33:49,884 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-3-u_true-unreach-call.i [2018-11-23 12:33:49,894 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161e3615/88c2437c295a4bf6ab5e11853ecf265c/FLAG1e16fb910 [2018-11-23 12:33:50,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161e3615/88c2437c295a4bf6ab5e11853ecf265c [2018-11-23 12:33:50,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:33:50,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:33:50,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:50,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:33:50,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:33:50,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:50" (1/1) ... [2018-11-23 12:33:50,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:50, skipping insertion in model container [2018-11-23 12:33:50,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:50" (1/1) ... [2018-11-23 12:33:50,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:33:50,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:33:50,538 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:50,543 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:33:50,595 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:50,630 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:33:50,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:50 WrapperNode [2018-11-23 12:33:50,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:50,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:50,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:33:50,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:33:50,643 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:50" (1/1) ... [2018-11-23 12:33:50,655 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:50" (1/1) ... [2018-11-23 12:33:50,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:50,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:33:50,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:33:50,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:33:50,678 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:50" (1/1) ... [2018-11-23 12:33:50,678 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:50" (1/1) ... [2018-11-23 12:33:50,680 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:50" (1/1) ... [2018-11-23 12:33:50,689 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:50" (1/1) ... [2018-11-23 12:33:50,702 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:50" (1/1) ... [2018-11-23 12:33:50,713 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:50" (1/1) ... [2018-11-23 12:33:50,715 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:50" (1/1) ... [2018-11-23 12:33:50,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:33:50,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:33:50,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:33:50,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:33:50,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:50" (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:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:33:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:33:50,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:33:50,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:33:50,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:33:50,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:33:50,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:33:50,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:33:50,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:33:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:33:50,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:33:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:33:51,787 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:33:51,788 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:33:51,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:51 BoogieIcfgContainer [2018-11-23 12:33:51,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:33:51,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:33:51,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:33:51,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:33:51,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:50" (1/3) ... [2018-11-23 12:33:51,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a593a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:51, skipping insertion in model container [2018-11-23 12:33:51,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:50" (2/3) ... [2018-11-23 12:33:51,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a593a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:51, skipping insertion in model container [2018-11-23 12:33:51,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:51" (3/3) ... [2018-11-23 12:33:51,799 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u_true-unreach-call.i [2018-11-23 12:33:51,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:33:51,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:33:51,836 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:33:51,868 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:33:51,869 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:33:51,869 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:33:51,869 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:33:51,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:33:51,870 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:33:51,870 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:33:51,870 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:33:51,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:33:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:33:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:51,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:51,899 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:51,901 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:51,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1773460249, now seen corresponding path program 1 times [2018-11-23 12:33:51,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:51,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:51,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:52,015 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:52,015 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:52,015 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:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:52,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:52,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:33:52,255 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:52,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:33:52,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #138#return; {39#true} is VALID [2018-11-23 12:33:52,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2018-11-23 12:33:52,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-23 12:33:52,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:33:52,259 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:52,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:33:52,259 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:52,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:33:52,260 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:52,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {40#false} is VALID [2018-11-23 12:33:52,261 INFO L256 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {40#false} is VALID [2018-11-23 12:33:52,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 12:33:52,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 12:33:52,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:33:52,265 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:52,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:52,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:33:52,301 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:52,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:52,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:33:52,395 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:52,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:33:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:33:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:33:52,405 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:33:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:52,641 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2018-11-23 12:33:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:33:52,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:33:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:33:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:33:52,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2018-11-23 12:33:53,161 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:53,174 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:33:53,174 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:33:53,178 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:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:33:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:33:53,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:53,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:53,360 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:53,360 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,365 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:53,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,366 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:53,367 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:33:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:53,371 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:33:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:53,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:53,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:53,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:53,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:33:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 12:33:53,378 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2018-11-23 12:33:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:53,379 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 12:33:53,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:33:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:33:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:33:53,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:53,380 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:53,381 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:53,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1763514787, now seen corresponding path program 1 times [2018-11-23 12:33:53,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:53,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:53,391 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:53,391 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:53,392 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:53,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:53,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:53,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 12:33:53,746 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:53,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 12:33:53,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #138#return; {291#true} is VALID [2018-11-23 12:33:53,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret5 := main(); {291#true} is VALID [2018-11-23 12:33:53,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {311#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:53,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume !(~i~0 < ~p~0); {292#false} is VALID [2018-11-23 12:33:53,751 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:53,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !(~i~0 < ~p~0); {292#false} is VALID [2018-11-23 12:33:53,752 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:53,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:33:53,752 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:53,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {292#false} is VALID [2018-11-23 12:33:53,753 INFO L256 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {292#false} is VALID [2018-11-23 12:33:53,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 12:33:53,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2018-11-23 12:33:53,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 12:33:53,755 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:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:33:53,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:53,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:53,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:33:53,838 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:53,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:33:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:33:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:53,839 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-11-23 12:33:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,304 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-23 12:33:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:33:54,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:33:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:33:54,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:33:54,478 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:54,481 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:33:54,482 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:33:54,483 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:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:33:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:33:54,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:54,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:54,518 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:54,518 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:33:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,521 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:54,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:54,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:54,523 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:54,523 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:33:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:54,526 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:33:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:33:54,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:54,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:54,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:54,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:33:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:33:54,531 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:33:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:54,531 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:33:54,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:33:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:33:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:33:54,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:54,533 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:54,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:54,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2133227694, now seen corresponding path program 1 times [2018-11-23 12:33:54,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:54,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:54,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:54,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:54,542 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:54,542 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:54,542 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:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:54,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:54,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-23 12:33:54,724 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:54,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-23 12:33:54,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #138#return; {546#true} is VALID [2018-11-23 12:33:54,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret5 := main(); {546#true} is VALID [2018-11-23 12:33:54,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {566#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:54,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {570#(and (<= 500 main_~p~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:54,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= 500 main_~p~0) (<= main_~j~0 0))} assume !(~j~0 < ~p~0); {547#false} is VALID [2018-11-23 12:33:54,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#false} ~i~0 := 1 + ~i~0; {547#false} is VALID [2018-11-23 12:33:54,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#false} assume !(~i~0 < ~p~0); {547#false} is VALID [2018-11-23 12:33:54,729 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:54,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#false} assume !(~i~0 < ~p~0); {547#false} is VALID [2018-11-23 12:33:54,729 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:54,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:33:54,730 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:54,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {547#false} is VALID [2018-11-23 12:33:54,731 INFO L256 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {547#false} is VALID [2018-11-23 12:33:54,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2018-11-23 12:33:54,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2018-11-23 12:33:54,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-23 12:33:54,734 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:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:54,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:54,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:54,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:54,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:54,794 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:54,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:54,796 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:33:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,209 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-23 12:33:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:55,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:33:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 12:33:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2018-11-23 12:33:55,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2018-11-23 12:33:55,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:55,428 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:33:55,428 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:33:55,429 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:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:33:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-23 12:33:55,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:55,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 34 states. [2018-11-23 12:33:55,469 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 34 states. [2018-11-23 12:33:55,469 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 34 states. [2018-11-23 12:33:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,474 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2018-11-23 12:33:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-23 12:33:55,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,479 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 47 states. [2018-11-23 12:33:55,479 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 47 states. [2018-11-23 12:33:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:55,487 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2018-11-23 12:33:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-23 12:33:55,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:55,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:55,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:55,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:33:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-23 12:33:55,493 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2018-11-23 12:33:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:55,494 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 12:33:55,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-11-23 12:33:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:33:55,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:55,495 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:55,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:55,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1108398309, now seen corresponding path program 1 times [2018-11-23 12:33:55,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:55,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:55,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:55,503 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:55,504 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:55,504 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:55,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:55,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:55,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {863#true} is VALID [2018-11-23 12:33:55,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {863#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {863#true} is VALID [2018-11-23 12:33:55,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 12:33:55,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {863#true} {863#true} #138#return; {863#true} is VALID [2018-11-23 12:33:55,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {863#true} call #t~ret5 := main(); {863#true} is VALID [2018-11-23 12:33:55,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {883#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:55,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {883#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {883#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:55,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {883#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {890#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:55,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {890#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {864#false} is VALID [2018-11-23 12:33:55,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {864#false} ~j~0 := 1 + ~j~0; {864#false} is VALID [2018-11-23 12:33:55,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {864#false} assume !(~j~0 < ~p~0); {864#false} is VALID [2018-11-23 12:33:55,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {864#false} ~i~0 := 1 + ~i~0; {864#false} is VALID [2018-11-23 12:33:55,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {864#false} assume !(~i~0 < ~p~0); {864#false} is VALID [2018-11-23 12:33:55,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {864#false} is VALID [2018-11-23 12:33:55,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#false} assume !(~i~0 < ~p~0); {864#false} is VALID [2018-11-23 12:33:55,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {864#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {864#false} is VALID [2018-11-23 12:33:55,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {864#false} is VALID [2018-11-23 12:33:55,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {864#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {864#false} is VALID [2018-11-23 12:33:55,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {864#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {864#false} is VALID [2018-11-23 12:33:55,809 INFO L256 TraceCheckUtils]: 19: Hoare triple {864#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {864#false} is VALID [2018-11-23 12:33:55,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {864#false} ~cond := #in~cond; {864#false} is VALID [2018-11-23 12:33:55,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {864#false} assume 0 == ~cond; {864#false} is VALID [2018-11-23 12:33:55,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {864#false} assume !false; {864#false} is VALID [2018-11-23 12:33:55,811 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:55,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:55,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:55,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:55,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:55,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:55,871 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:55,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:55,872 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 4 states. [2018-11-23 12:33:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:56,219 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2018-11-23 12:33:56,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:56,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:33:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 12:33:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-23 12:33:56,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-23 12:33:56,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:56,349 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:33:56,349 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:33:56,350 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:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:33:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 12:33:56,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:56,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2018-11-23 12:33:56,447 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2018-11-23 12:33:56,447 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2018-11-23 12:33:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:56,451 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-11-23 12:33:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 12:33:56,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:56,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:56,452 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2018-11-23 12:33:56,452 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2018-11-23 12:33:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:56,456 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-11-23 12:33:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 12:33:56,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:56,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:56,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:56,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:33:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 12:33:56,459 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 23 [2018-11-23 12:33:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:56,460 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 12:33:56,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 12:33:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:33:56,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:56,461 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:56,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:56,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1602833213, now seen corresponding path program 1 times [2018-11-23 12:33:56,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:56,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:56,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:56,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:56,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:56,469 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:56,470 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:56,470 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:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:56,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:56,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2018-11-23 12:33:56,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {1191#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1191#true} is VALID [2018-11-23 12:33:56,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2018-11-23 12:33:56,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #138#return; {1191#true} is VALID [2018-11-23 12:33:56,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2018-11-23 12:33:56,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {1191#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1211#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:56,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {1211#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1211#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:56,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {1211#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {1218#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:56,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {1218#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1222#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:56,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {1222#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1192#false} is VALID [2018-11-23 12:33:56,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {1192#false} ~j~0 := 1 + ~j~0; {1192#false} is VALID [2018-11-23 12:33:56,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {1192#false} assume !(~j~0 < ~p~0); {1192#false} is VALID [2018-11-23 12:33:56,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {1192#false} ~i~0 := 1 + ~i~0; {1192#false} is VALID [2018-11-23 12:33:56,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {1192#false} assume !(~i~0 < ~p~0); {1192#false} is VALID [2018-11-23 12:33:56,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {1192#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1192#false} is VALID [2018-11-23 12:33:56,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {1192#false} assume !(~i~0 < ~p~0); {1192#false} is VALID [2018-11-23 12:33:56,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {1192#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1192#false} is VALID [2018-11-23 12:33:56,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {1192#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1192#false} is VALID [2018-11-23 12:33:56,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {1192#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1192#false} is VALID [2018-11-23 12:33:56,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {1192#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1192#false} is VALID [2018-11-23 12:33:56,694 INFO L256 TraceCheckUtils]: 20: Hoare triple {1192#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1192#false} is VALID [2018-11-23 12:33:56,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2018-11-23 12:33:56,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2018-11-23 12:33:56,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2018-11-23 12:33:56,695 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:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:56,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:56,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:56,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:56,756 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:56,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:56,757 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 5 states. [2018-11-23 12:33:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,265 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2018-11-23 12:33:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:57,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:33:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 12:33:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-23 12:33:57,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2018-11-23 12:33:57,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:57,410 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:33:57,410 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:33:57,411 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:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:33:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-23 12:33:57,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:57,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 38 states. [2018-11-23 12:33:57,522 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 38 states. [2018-11-23 12:33:57,522 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 38 states. [2018-11-23 12:33:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,526 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:33:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-23 12:33:57,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:57,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:57,527 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 54 states. [2018-11-23 12:33:57,528 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 54 states. [2018-11-23 12:33:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:57,531 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 12:33:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-23 12:33:57,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:57,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:57,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:57,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:33:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:33:57,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 24 [2018-11-23 12:33:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:57,536 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:33:57,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:33:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:33:57,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:57,537 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:57,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:57,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 249553947, now seen corresponding path program 2 times [2018-11-23 12:33:57,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:57,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:57,545 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:57,546 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:57,546 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:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:57,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:33:57,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:57,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:57,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-23 12:33:57,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1564#true} is VALID [2018-11-23 12:33:57,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-23 12:33:57,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1564#true} #138#return; {1564#true} is VALID [2018-11-23 12:33:57,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {1564#true} call #t~ret5 := main(); {1564#true} is VALID [2018-11-23 12:33:57,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {1564#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {1584#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {1584#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {1584#(<= 500 main_~p~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {1584#(<= 500 main_~p~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {1584#(<= 500 main_~p~0)} assume !(~k~0 < ~p~0); {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {1584#(<= 500 main_~p~0)} ~j~0 := 1 + ~j~0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {1584#(<= 500 main_~p~0)} assume !(~j~0 < ~p~0); {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {1584#(<= 500 main_~p~0)} ~i~0 := 1 + ~i~0; {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {1584#(<= 500 main_~p~0)} assume !(~i~0 < ~p~0); {1584#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:57,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {1584#(<= 500 main_~p~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1615#(and (<= 500 main_~p~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:33:57,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {1615#(and (<= 500 main_~p~0) (<= main_~i~0 0))} assume !(~i~0 < ~p~0); {1565#false} is VALID [2018-11-23 12:33:57,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {1565#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1565#false} is VALID [2018-11-23 12:33:57,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {1565#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1565#false} is VALID [2018-11-23 12:33:57,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {1565#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1565#false} is VALID [2018-11-23 12:33:57,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {1565#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1565#false} is VALID [2018-11-23 12:33:57,694 INFO L256 TraceCheckUtils]: 21: Hoare triple {1565#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1565#false} is VALID [2018-11-23 12:33:57,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1565#false} ~cond := #in~cond; {1565#false} is VALID [2018-11-23 12:33:57,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {1565#false} assume 0 == ~cond; {1565#false} is VALID [2018-11-23 12:33:57,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-23 12:33:57,697 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:57,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:57,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:57,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:57,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:57,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:57,825 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:57,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:57,827 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 12:33:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,197 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-23 12:33:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:58,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:33:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:33:58,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-23 12:33:58,323 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:58,326 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:33:58,326 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:33:58,327 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:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:33:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2018-11-23 12:33:58,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:58,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 39 states. [2018-11-23 12:33:58,402 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 39 states. [2018-11-23 12:33:58,402 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 39 states. [2018-11-23 12:33:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,405 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:33:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:33:58,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:58,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:58,406 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 60 states. [2018-11-23 12:33:58,406 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 60 states. [2018-11-23 12:33:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:58,409 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:33:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:33:58,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:58,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:58,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:58,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:33:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:33:58,413 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 25 [2018-11-23 12:33:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:58,413 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:33:58,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:33:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:33:58,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:58,414 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:58,415 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1698801625, now seen corresponding path program 1 times [2018-11-23 12:33:58,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:58,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:58,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:58,423 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:58,423 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:58,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:58,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:59,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {1940#true} call ULTIMATE.init(); {1940#true} is VALID [2018-11-23 12:33:59,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {1940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1940#true} is VALID [2018-11-23 12:33:59,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 12:33:59,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1940#true} {1940#true} #138#return; {1940#true} is VALID [2018-11-23 12:33:59,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {1940#true} call #t~ret5 := main(); {1940#true} is VALID [2018-11-23 12:33:59,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {1940#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1960#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:59,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {1960#(<= 500 main_~p~0)} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1960#(<= 500 main_~p~0)} is VALID [2018-11-23 12:33:59,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {1960#(<= 500 main_~p~0)} assume !!(~j~0 < ~p~0);~k~0 := 0; {1967#(and (<= 500 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:33:59,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1967#(and (<= 500 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1971#(and (<= 500 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:33:59,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {1971#(and (<= 500 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1975#(and (<= 500 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:33:59,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1975#(and (<= 500 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {1941#false} ~j~0 := 1 + ~j~0; {1941#false} is VALID [2018-11-23 12:33:59,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {1941#false} assume !(~j~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {1941#false} ~i~0 := 1 + ~i~0; {1941#false} is VALID [2018-11-23 12:33:59,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {1941#false} assume !(~i~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {1941#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1941#false} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {1941#false} assume !!(~j~0 < ~p~0);~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {1941#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {1941#false} is VALID [2018-11-23 12:33:59,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {1941#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {1941#false} is VALID [2018-11-23 12:33:59,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {1941#false} assume !(~k~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {1941#false} ~j~0 := 1 + ~j~0; {1941#false} is VALID [2018-11-23 12:33:59,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {1941#false} assume !(~j~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {1941#false} ~i~0 := 1 + ~i~0; {1941#false} is VALID [2018-11-23 12:33:59,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {1941#false} assume !(~i~0 < ~p~0); {1941#false} is VALID [2018-11-23 12:33:59,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {1941#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {1941#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {1941#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1941#false} is VALID [2018-11-23 12:33:59,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {1941#false} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1941#false} is VALID [2018-11-23 12:33:59,244 INFO L256 TraceCheckUtils]: 29: Hoare triple {1941#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1941#false} is VALID [2018-11-23 12:33:59,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {1941#false} ~cond := #in~cond; {1941#false} is VALID [2018-11-23 12:33:59,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {1941#false} assume 0 == ~cond; {1941#false} is VALID [2018-11-23 12:33:59,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {1941#false} assume !false; {1941#false} is VALID [2018-11-23 12:33:59,247 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:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:33:59,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:33:59,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:59,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:33:59,329 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:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:33:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:33:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:59,330 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-11-23 12:34:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:00,068 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2018-11-23 12:34:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:00,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:34:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 12:34:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 12:34:00,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-23 12:34:00,313 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:34:00,316 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:34:00,316 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:34:00,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:34:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-11-23 12:34:00,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:00,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 41 states. [2018-11-23 12:34:00,732 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 41 states. [2018-11-23 12:34:00,732 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 41 states. [2018-11-23 12:34:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:00,735 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-11-23 12:34:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-23 12:34:00,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:00,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:00,736 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 62 states. [2018-11-23 12:34:00,736 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 62 states. [2018-11-23 12:34:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:00,739 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-11-23 12:34:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-23 12:34:00,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:00,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:00,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:00,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:34:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:34:00,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2018-11-23 12:34:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:00,742 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:34:00,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:34:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:34:00,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:00,743 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:34:00,744 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:00,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash -602786922, now seen corresponding path program 2 times [2018-11-23 12:34:00,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:00,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:00,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:00,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:00,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:00,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:00,752 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:00,752 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:34:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:00,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:34:00,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:00,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:00,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-23 12:34:00,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 3 [2018-11-23 12:34:00,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:34:00,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:34:00,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:34:00,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:51, output treesize:3 [2018-11-23 12:34:00,987 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:34:00,987 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~i~0, main_~n~0, |main_~#A~0.offset|, main_~j~0, main_~k~0, |#memory_int|, |main_~#A~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#A~0.base|) (+ (let ((.cse1 (* 4 main_~n~0))) (+ (+ |main_~#A~0.offset| (* main_~i~0 (* .cse1 main_~n~0))) (* main_~j~0 .cse1))) (* 4 main_~k~0))))) (and (= .cse0 |main_#t~mem4|) (= .cse0 |main_#t~mem3|))) [2018-11-23 12:34:00,988 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem4| |main_#t~mem3|) [2018-11-23 12:34:01,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {2383#true} call ULTIMATE.init(); {2383#true} is VALID [2018-11-23 12:34:01,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {2383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2383#true} is VALID [2018-11-23 12:34:01,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {2383#true} assume true; {2383#true} is VALID [2018-11-23 12:34:01,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2383#true} {2383#true} #138#return; {2383#true} is VALID [2018-11-23 12:34:01,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {2383#true} call #t~ret5 := main(); {2383#true} is VALID [2018-11-23 12:34:01,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {2383#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;~p~0 := 500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0 * ~n~0);assume 0 != (if ~p~0 < ~n~0 then 1 else 0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {2383#true} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {2383#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {2383#true} assume !(~k~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {2383#true} ~j~0 := 1 + ~j~0; {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {2383#true} assume !(~j~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {2383#true} ~i~0 := 1 + ~i~0; {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {2383#true} assume !(~i~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {2383#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {2383#true} assume !!(~i~0 < ~p~0);~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {2383#true} assume !!(~j~0 < ~p~0);~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 20: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {2383#true} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call write~int(#t~mem2, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);havoc #t~mem2;~k~0 := 1 + ~k~0; {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {2383#true} assume !(~k~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {2383#true} ~j~0 := 1 + ~j~0; {2383#true} is VALID [2018-11-23 12:34:01,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {2383#true} assume !(~j~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {2383#true} ~i~0 := 1 + ~i~0; {2383#true} is VALID [2018-11-23 12:34:01,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {2383#true} assume !(~i~0 < ~p~0); {2383#true} is VALID [2018-11-23 12:34:01,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {2383#true} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {2383#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {2383#true} assume !!(~j~0 < ~n~0);~k~0 := 0; {2383#true} is VALID [2018-11-23 12:34:01,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {2383#true} assume !!(~k~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2478#(= |main_#t~mem4| |main_#t~mem3|)} is VALID [2018-11-23 12:34:01,027 INFO L256 TraceCheckUtils]: 31: Hoare triple {2478#(= |main_#t~mem4| |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2482#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:34:01,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {2482#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2486#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:34:01,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {2486#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2384#false} is VALID [2018-11-23 12:34:01,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {2384#false} assume !false; {2384#false} is VALID [2018-11-23 12:34:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:34:01,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:01,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:34:01,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 12:34:01,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:01,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:01,085 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:34:01,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:01,087 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-23 12:34:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:01,292 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 12:34:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:01,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 12:34:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 12:34:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 12:34:01,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-23 12:34:01,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:01,357 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:34:01,357 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:34:01,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:34:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:34:01,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:01,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:34:01,359 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:34:01,359 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:34:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:01,359 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:34:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:34:01,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:01,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:01,360 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:34:01,360 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:34:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:01,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:34:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:34:01,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:01,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:01,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:01,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:34:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:34:01,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-23 12:34:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:01,362 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:34:01,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:34:01,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:01,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:34:01,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:34:01,571 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:34:01,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:34:01,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:34:01,572 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:34:01,572 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:34:01,572 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:34:01,572 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 81) no Hoare annotation was computed. [2018-11-23 12:34:01,572 INFO L444 ceAbstractionStarter]: At program point L52-2(lines 52 55) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,572 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 52 55) no Hoare annotation was computed. [2018-11-23 12:34:01,572 INFO L444 ceAbstractionStarter]: At program point L70-2(lines 70 77) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,572 INFO L448 ceAbstractionStarter]: For program point L70-3(lines 70 77) no Hoare annotation was computed. [2018-11-23 12:34:01,572 INFO L444 ceAbstractionStarter]: At program point L29-2(lines 29 36) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,573 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 29 36) no Hoare annotation was computed. [2018-11-23 12:34:01,573 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 81) no Hoare annotation was computed. [2018-11-23 12:34:01,573 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 81) the Hoare annotation is: true [2018-11-23 12:34:01,573 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 59) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,573 INFO L448 ceAbstractionStarter]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2018-11-23 12:34:01,573 INFO L444 ceAbstractionStarter]: At program point L72-2(lines 72 75) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,573 INFO L448 ceAbstractionStarter]: For program point L72-3(lines 72 75) no Hoare annotation was computed. [2018-11-23 12:34:01,574 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 34) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,574 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 31 34) no Hoare annotation was computed. [2018-11-23 12:34:01,574 INFO L444 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (and (<= 500 main_~p~0) (= |main_#t~mem4| |main_#t~mem3|)) [2018-11-23 12:34:01,574 INFO L448 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-11-23 12:34:01,574 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 57) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,574 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 57) no Hoare annotation was computed. [2018-11-23 12:34:01,574 INFO L444 ceAbstractionStarter]: At program point L67-2(lines 67 79) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,574 INFO L448 ceAbstractionStarter]: For program point L67-3(lines 67 79) no Hoare annotation was computed. [2018-11-23 12:34:01,574 INFO L444 ceAbstractionStarter]: At program point L26-2(lines 26 38) the Hoare annotation is: (<= 500 main_~p~0) [2018-11-23 12:34:01,574 INFO L448 ceAbstractionStarter]: For program point L26-3(lines 26 38) no Hoare annotation was computed. [2018-11-23 12:34:01,575 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 12:34:01,575 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 12:34:01,575 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 12:34:01,575 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 12:34:01,575 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 12:34:01,575 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 12:34:01,577 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:34:01,578 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 12:34:01,578 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:34:01,578 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:34:01,578 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2018-11-23 12:34:01,578 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2018-11-23 12:34:01,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 12:34:01,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 12:34:01,582 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:34:01,582 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:34:01,582 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2018-11-23 12:34:01,583 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2018-11-23 12:34:01,583 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2018-11-23 12:34:01,583 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 12:34:01,583 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 12:34:01,584 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 12:34:01,584 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2018-11-23 12:34:01,584 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2018-11-23 12:34:01,585 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2018-11-23 12:34:01,586 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2018-11-23 12:34:01,587 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 12:34:01,587 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:34:01,587 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2018-11-23 12:34:01,587 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2018-11-23 12:34:01,588 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2018-11-23 12:34:01,588 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2018-11-23 12:34:01,588 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2018-11-23 12:34:01,589 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2018-11-23 12:34:01,589 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2018-11-23 12:34:01,589 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2018-11-23 12:34:01,589 WARN L170 areAnnotationChecker]: L70-3 has no Hoare annotation [2018-11-23 12:34:01,589 WARN L170 areAnnotationChecker]: L70-3 has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: L70-3 has no Hoare annotation [2018-11-23 12:34:01,590 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:34:01,591 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:34:01,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:34:01 BoogieIcfgContainer [2018-11-23 12:34:01,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:34:01,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:34:01,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:34:01,602 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:34:01,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:51" (3/4) ... [2018-11-23 12:34:01,606 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:34:01,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:34:01,615 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:34:01,615 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 12:34:01,620 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 12:34:01,620 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 12:34:01,621 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:34:01,621 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:34:01,684 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-multidimensional/copy-partial-3-u_true-unreach-call.i-witness.graphml [2018-11-23 12:34:01,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:34:01,685 INFO L168 Benchmark]: Toolchain (without parser) took 11433.54 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.1 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,687 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,689 INFO L168 Benchmark]: Boogie Preprocessor took 52.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,689 INFO L168 Benchmark]: RCFGBuilder took 1072.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,690 INFO L168 Benchmark]: TraceAbstraction took 9810.53 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 170.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.5 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:01,690 INFO L168 Benchmark]: Witness Printer took 82.26 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:01,693 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 377.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1072.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -719.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9810.53 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 170.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.5 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * Witness Printer took 82.26 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 500 <= p - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 500 <= p - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 9.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 222 SDslu, 265 SDs, 0 SdLazy, 216 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 22 PreInvPairs, 42 NumberOfFragments, 39 HoareAnnotationTreeSize, 22 FomulaSimplifications, 4772 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 194 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 7010 SizeOfPredicates, 22 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 33/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...