java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:59:18,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:59:18,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:59:18,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:59:18,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:59:18,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:59:18,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:59:18,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:59:18,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:59:18,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:59:18,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:59:18,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:59:18,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:59:18,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:59:18,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:59:18,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:59:18,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:59:18,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:59:18,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:59:18,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:59:18,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:59:18,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:59:18,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:59:18,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:59:18,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:59:18,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:59:18,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:59:18,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:59:18,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:59:18,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:59:18,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:59:18,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:59:18,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:59:18,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:59:18,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:59:18,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:59:18,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:59:18,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:59:18,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:59:18,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:59:18,181 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:59:18,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:59:18,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:59:18,186 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:59:18,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:59:18,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:59:18,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:59:18,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:59:18,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:59:18,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:59:18,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:59:18,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:59:18,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:59:18,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:59:18,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:59:18,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:59:18,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:59:18,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:59:18,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:59:18,191 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:59:18,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:18,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:59:18,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:59:18,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:59:18,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:59:18,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:59:18,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:59:18,193 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:59:18,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:59:18,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:59:18,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:59:18,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:59:18,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:59:18,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i [2018-11-14 18:59:18,347 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5a71f4d/86e13cbae7154fcebca008d4080687f4/FLAG7d179724e [2018-11-14 18:59:18,782 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:59:18,783 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i [2018-11-14 18:59:18,789 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5a71f4d/86e13cbae7154fcebca008d4080687f4/FLAG7d179724e [2018-11-14 18:59:18,804 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5a71f4d/86e13cbae7154fcebca008d4080687f4 [2018-11-14 18:59:18,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:59:18,816 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:59:18,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:18,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:59:18,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:59:18,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:18" (1/1) ... [2018-11-14 18:59:18,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b8652e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:18, skipping insertion in model container [2018-11-14 18:59:18,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:18" (1/1) ... [2018-11-14 18:59:18,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:59:18,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:59:19,143 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:19,150 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:59:19,191 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:19,215 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:59:19,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19 WrapperNode [2018-11-14 18:59:19,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:19,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:59:19,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:59:19,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:59:19,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... [2018-11-14 18:59:19,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:59:19,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:59:19,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:59:19,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:59:19,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:59:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:59:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:59:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:59:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:59:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:59:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:59:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:59:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:59:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:59:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:59:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:59:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:59:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:59:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:59:20,081 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:59:20,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:20 BoogieIcfgContainer [2018-11-14 18:59:20,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:59:20,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:59:20,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:59:20,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:59:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:59:18" (1/3) ... [2018-11-14 18:59:20,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aa79b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:20, skipping insertion in model container [2018-11-14 18:59:20,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:19" (2/3) ... [2018-11-14 18:59:20,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aa79b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:20, skipping insertion in model container [2018-11-14 18:59:20,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:20" (3/3) ... [2018-11-14 18:59:20,091 INFO L112 eAbstractionObserver]: Analyzing ICFG init-3-u_true-unreach-call.i [2018-11-14 18:59:20,101 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:59:20,109 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:59:20,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:59:20,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:59:20,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:59:20,161 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:59:20,161 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:59:20,161 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:59:20,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:59:20,162 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:59:20,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:59:20,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:59:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 18:59:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:59:20,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:20,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:20,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash 142166787, now seen corresponding path program 1 times [2018-11-14 18:59:20,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:20,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:20,294 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:20,294 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-14 18:59:20,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:20,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 18:59:20,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-14 18:59:20,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:59:20,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-14 18:59:20,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret2 := main(); {39#true} is VALID [2018-11-14 18:59:20,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-14 18:59:20,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 18:59:20,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-14 18:59:20,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 18:59:20,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-14 18:59:20,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 18:59:20,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-14 18:59:20,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 18:59:20,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {40#false} is VALID [2018-11-14 18:59:20,492 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {40#false} is VALID [2018-11-14 18:59:20,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 18:59:20,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~cond == 0; {40#false} is VALID [2018-11-14 18:59:20,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 18:59:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:20,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:20,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:59:20,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:59:20,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:20,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:59:20,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:20,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:59:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:59:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:20,777 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 18:59:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,107 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-14 18:59:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:59:21,108 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:59:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-14 18:59:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-14 18:59:21,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-14 18:59:21,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:21,390 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:59:21,390 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:59:21,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:59:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 18:59:21,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:21,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 18:59:21,452 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:59:21,453 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:59:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,459 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 18:59:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 18:59:21,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:21,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:21,460 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:59:21,461 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:59:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,465 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 18:59:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 18:59:21,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:21,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:21,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:21,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:59:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 18:59:21,472 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-14 18:59:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:21,473 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 18:59:21,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:59:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 18:59:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:59:21,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:21,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:21,475 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:21,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash -914168140, now seen corresponding path program 1 times [2018-11-14 18:59:21,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:21,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:21,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:21,486 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:21,486 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:21,486 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-14 18:59:21,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:21,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:21,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-14 18:59:21,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {285#true} is VALID [2018-11-14 18:59:21,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-14 18:59:21,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #105#return; {285#true} is VALID [2018-11-14 18:59:21,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret2 := main(); {285#true} is VALID [2018-11-14 18:59:21,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {305#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:21,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {305#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:21,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {286#false} is VALID [2018-11-14 18:59:21,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {286#false} is VALID [2018-11-14 18:59:21,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 18:59:21,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {286#false} is VALID [2018-11-14 18:59:21,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 18:59:21,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {286#false} is VALID [2018-11-14 18:59:21,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-14 18:59:21,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {286#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {286#false} is VALID [2018-11-14 18:59:21,814 INFO L256 TraceCheckUtils]: 15: Hoare triple {286#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {286#false} is VALID [2018-11-14 18:59:21,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2018-11-14 18:59:21,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} assume ~cond == 0; {286#false} is VALID [2018-11-14 18:59:21,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-14 18:59:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:59:21,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:59:21,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:21,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:59:22,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:22,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:59:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:59:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:22,029 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 18:59:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,423 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-14 18:59:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:59:22,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:59:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 18:59:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 18:59:22,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-14 18:59:22,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:22,535 INFO L225 Difference]: With dead ends: 56 [2018-11-14 18:59:22,536 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:59:22,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:59:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-14 18:59:22,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:22,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2018-11-14 18:59:22,560 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2018-11-14 18:59:22,560 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2018-11-14 18:59:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,563 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 18:59:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-14 18:59:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:22,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2018-11-14 18:59:22,565 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2018-11-14 18:59:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,568 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 18:59:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-14 18:59:22,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:22,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:22,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:22,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:59:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 18:59:22,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2018-11-14 18:59:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:22,573 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 18:59:22,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:59:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:59:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:59:22,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:22,574 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:22,574 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:22,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash -934817045, now seen corresponding path program 1 times [2018-11-14 18:59:22,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:22,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:22,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:22,586 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:22,586 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:22,586 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-14 18:59:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:22,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:22,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-14 18:59:22,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {544#true} is VALID [2018-11-14 18:59:22,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-14 18:59:22,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #105#return; {544#true} is VALID [2018-11-14 18:59:22,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-14 18:59:22,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {564#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:22,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(<= 1000 main_~n~0)} assume true; {564#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:22,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {564#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {571#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:22,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {571#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {571#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:22,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {545#false} is VALID [2018-11-14 18:59:22,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {545#false} ~i~0 := ~i~0 + 1; {545#false} is VALID [2018-11-14 18:59:22,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-14 18:59:22,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !(~i~0 < ~n~0); {545#false} is VALID [2018-11-14 18:59:22,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {545#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {545#false} is VALID [2018-11-14 18:59:22,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-14 18:59:22,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {545#false} is VALID [2018-11-14 18:59:22,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-14 18:59:22,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {545#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {545#false} is VALID [2018-11-14 18:59:22,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-14 18:59:22,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {545#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {545#false} is VALID [2018-11-14 18:59:22,862 INFO L256 TraceCheckUtils]: 20: Hoare triple {545#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {545#false} is VALID [2018-11-14 18:59:22,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-14 18:59:22,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {545#false} assume ~cond == 0; {545#false} is VALID [2018-11-14 18:59:22,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-14 18:59:22,865 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-14 18:59:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:22,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-14 18:59:22,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:22,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:22,942 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-14 18:59:22,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:22,943 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-14 18:59:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,222 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 18:59:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:23,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-14 18:59:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 18:59:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 18:59:23,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-14 18:59:23,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:23,356 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:59:23,356 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:59:23,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-14 18:59:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:59:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-14 18:59:23,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:23,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 37 states. [2018-11-14 18:59:23,420 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 37 states. [2018-11-14 18:59:23,421 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 37 states. [2018-11-14 18:59:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,425 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-14 18:59:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-14 18:59:23,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:23,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:23,427 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 47 states. [2018-11-14 18:59:23,427 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 47 states. [2018-11-14 18:59:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,431 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-14 18:59:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-14 18:59:23,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:23,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:23,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:23,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:59:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 18:59:23,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2018-11-14 18:59:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:23,435 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 18:59:23,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 18:59:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:59:23,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:23,436 INFO L375 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] [2018-11-14 18:59:23,436 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:23,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash 119359556, now seen corresponding path program 1 times [2018-11-14 18:59:23,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:23,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:23,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:23,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:23,445 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-14 18:59:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:23,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:23,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-14 18:59:23,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-14 18:59:23,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-14 18:59:23,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #105#return; {864#true} is VALID [2018-11-14 18:59:23,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret2 := main(); {864#true} is VALID [2018-11-14 18:59:23,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {864#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {884#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:23,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#(<= 1000 main_~n~0)} assume true; {884#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:23,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {884#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:23,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(<= 1000 main_~n~0)} assume true; {884#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:23,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {897#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:23,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {897#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {897#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:23,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {897#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !(~k~0 < ~n~0); {865#false} is VALID [2018-11-14 18:59:23,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#false} ~j~0 := ~j~0 + 1; {865#false} is VALID [2018-11-14 18:59:23,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 18:59:23,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(~j~0 < ~n~0); {865#false} is VALID [2018-11-14 18:59:23,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#false} ~i~0 := ~i~0 + 1; {865#false} is VALID [2018-11-14 18:59:23,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 18:59:23,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#false} assume !(~i~0 < ~n~0); {865#false} is VALID [2018-11-14 18:59:23,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {865#false} is VALID [2018-11-14 18:59:23,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 18:59:23,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {865#false} is VALID [2018-11-14 18:59:23,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 18:59:23,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {865#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {865#false} is VALID [2018-11-14 18:59:23,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-14 18:59:23,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {865#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {865#false} is VALID [2018-11-14 18:59:23,623 INFO L256 TraceCheckUtils]: 25: Hoare triple {865#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {865#false} is VALID [2018-11-14 18:59:23,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2018-11-14 18:59:23,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {865#false} assume ~cond == 0; {865#false} is VALID [2018-11-14 18:59:23,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-14 18:59:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:23,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:23,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:23,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 18:59:23,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:23,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:23,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:23,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:23,694 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-11-14 18:59:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,930 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-14 18:59:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:23,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 18:59:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-14 18:59:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-14 18:59:23,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-14 18:59:24,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:24,153 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:59:24,153 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 18:59:24,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-14 18:59:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 18:59:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-14 18:59:24,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:24,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2018-11-14 18:59:24,201 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2018-11-14 18:59:24,201 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2018-11-14 18:59:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,205 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:59:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:59:24,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:24,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:24,206 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2018-11-14 18:59:24,206 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2018-11-14 18:59:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,210 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:59:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:59:24,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:24,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:24,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:24,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:59:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 18:59:24,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-14 18:59:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:24,214 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 18:59:24,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:59:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:59:24,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:24,216 INFO L375 BasicCegarLoop]: trace histogram [2, 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] [2018-11-14 18:59:24,216 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:24,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1885100254, now seen corresponding path program 1 times [2018-11-14 18:59:24,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:24,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:24,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:24,225 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:24,225 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:24,225 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-14 18:59:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:24,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:24,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {1205#true} call ULTIMATE.init(); {1205#true} is VALID [2018-11-14 18:59:24,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {1205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1205#true} is VALID [2018-11-14 18:59:24,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1205#true} assume true; {1205#true} is VALID [2018-11-14 18:59:24,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1205#true} {1205#true} #105#return; {1205#true} is VALID [2018-11-14 18:59:24,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1205#true} call #t~ret2 := main(); {1205#true} is VALID [2018-11-14 18:59:24,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {1205#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:24,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(<= 1000 main_~n~0)} assume true; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:24,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:24,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {1225#(<= 1000 main_~n~0)} assume true; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:24,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1225#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1238#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:24,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {1238#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {1238#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:24,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {1238#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {1245#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:24,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume true; {1245#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:24,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {1245#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !(~k~0 < ~n~0); {1206#false} is VALID [2018-11-14 18:59:24,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {1206#false} ~j~0 := ~j~0 + 1; {1206#false} is VALID [2018-11-14 18:59:24,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-14 18:59:24,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {1206#false} assume !(~j~0 < ~n~0); {1206#false} is VALID [2018-11-14 18:59:24,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {1206#false} ~i~0 := ~i~0 + 1; {1206#false} is VALID [2018-11-14 18:59:24,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-14 18:59:24,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {1206#false} assume !(~i~0 < ~n~0); {1206#false} is VALID [2018-11-14 18:59:24,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {1206#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1206#false} is VALID [2018-11-14 18:59:24,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-14 18:59:24,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {1206#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1206#false} is VALID [2018-11-14 18:59:24,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-14 18:59:24,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {1206#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1206#false} is VALID [2018-11-14 18:59:24,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-14 18:59:24,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {1206#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {1206#false} is VALID [2018-11-14 18:59:24,437 INFO L256 TraceCheckUtils]: 27: Hoare triple {1206#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1206#false} is VALID [2018-11-14 18:59:24,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {1206#false} ~cond := #in~cond; {1206#false} is VALID [2018-11-14 18:59:24,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#false} assume ~cond == 0; {1206#false} is VALID [2018-11-14 18:59:24,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#false} assume !false; {1206#false} is VALID [2018-11-14 18:59:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:24,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:24,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:59:24,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:59:24,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:24,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:24,493 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-14 18:59:24,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:24,495 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-14 18:59:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,797 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-14 18:59:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:24,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:59:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-14 18:59:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-14 18:59:24,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2018-11-14 18:59:24,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:24,927 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:59:24,927 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:59:24,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-14 18:59:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:59:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 18:59:24,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:24,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 18:59:24,991 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 18:59:24,991 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 18:59:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,995 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 18:59:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 18:59:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:24,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:24,997 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 18:59:24,997 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 18:59:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,000 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 18:59:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 18:59:25,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:25,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:25,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:25,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:59:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 18:59:25,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2018-11-14 18:59:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:25,005 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 18:59:25,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:59:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:59:25,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:25,007 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-11-14 18:59:25,007 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:25,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2045138184, now seen corresponding path program 2 times [2018-11-14 18:59:25,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:25,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:25,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:25,015 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:25,015 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:25,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 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-14 18:59:25,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:25,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:59:25,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:25,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:25,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2018-11-14 18:59:25,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {1589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1589#true} is VALID [2018-11-14 18:59:25,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2018-11-14 18:59:25,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #105#return; {1589#true} is VALID [2018-11-14 18:59:25,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret2 := main(); {1589#true} is VALID [2018-11-14 18:59:25,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {1589#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:25,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {1609#(<= 1000 main_~n~0)} assume true; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:25,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {1609#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:25,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {1609#(<= 1000 main_~n~0)} assume true; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-14 18:59:25,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {1609#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1622#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:25,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {1622#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {1622#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:25,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {1622#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {1629#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:25,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {1629#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume true; {1629#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:25,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1629#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {1636#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:25,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {1636#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume true; {1636#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:25,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {1636#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !(~k~0 < ~n~0); {1590#false} is VALID [2018-11-14 18:59:25,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {1590#false} ~j~0 := ~j~0 + 1; {1590#false} is VALID [2018-11-14 18:59:25,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-14 18:59:25,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {1590#false} assume !(~j~0 < ~n~0); {1590#false} is VALID [2018-11-14 18:59:25,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {1590#false} ~i~0 := ~i~0 + 1; {1590#false} is VALID [2018-11-14 18:59:25,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-14 18:59:25,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~n~0); {1590#false} is VALID [2018-11-14 18:59:25,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1590#false} is VALID [2018-11-14 18:59:25,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-14 18:59:25,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {1590#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1590#false} is VALID [2018-11-14 18:59:25,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-14 18:59:25,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {1590#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1590#false} is VALID [2018-11-14 18:59:25,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-14 18:59:25,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {1590#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {1590#false} is VALID [2018-11-14 18:59:25,266 INFO L256 TraceCheckUtils]: 29: Hoare triple {1590#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1590#false} is VALID [2018-11-14 18:59:25,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2018-11-14 18:59:25,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {1590#false} assume ~cond == 0; {1590#false} is VALID [2018-11-14 18:59:25,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2018-11-14 18:59:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 18:59:25,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 18:59:25,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:25,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:59:25,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:25,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:59:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:59:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:25,333 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-11-14 18:59:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,687 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-14 18:59:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:59:25,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-14 18:59:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:59:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:59:25,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2018-11-14 18:59:25,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:25,900 INFO L225 Difference]: With dead ends: 96 [2018-11-14 18:59:25,901 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:59:25,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:59:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-14 18:59:25,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:25,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-14 18:59:25,993 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-14 18:59:25,993 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-14 18:59:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,997 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:59:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:59:25,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:25,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-14 18:59:25,998 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-14 18:59:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,001 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:59:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:59:26,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:26,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:26,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:26,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:59:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-14 18:59:26,005 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 33 [2018-11-14 18:59:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:26,005 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-14 18:59:26,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:59:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-14 18:59:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:59:26,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:26,007 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-14 18:59:26,007 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:26,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash 566943378, now seen corresponding path program 3 times [2018-11-14 18:59:26,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,016 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:26,016 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:26,016 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-14 18:59:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:59:26,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:59:26,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:26,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:26,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {2019#true} call ULTIMATE.init(); {2019#true} is VALID [2018-11-14 18:59:26,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {2019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2019#true} is VALID [2018-11-14 18:59:26,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {2019#true} assume true; {2019#true} is VALID [2018-11-14 18:59:26,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2019#true} {2019#true} #105#return; {2019#true} is VALID [2018-11-14 18:59:26,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {2019#true} call #t~ret2 := main(); {2019#true} is VALID [2018-11-14 18:59:26,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {2019#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~k~0 < ~n~0); {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:26,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := ~i~0 + 1; {2088#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 18:59:26,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {2088#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume true; {2088#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 18:59:26,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {2088#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {2020#false} is VALID [2018-11-14 18:59:26,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {2020#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 18:59:26,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:59:26,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {2020#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 18:59:26,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:59:26,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2020#false} is VALID [2018-11-14 18:59:26,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:59:26,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {2020#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {2020#false} is VALID [2018-11-14 18:59:26,241 INFO L256 TraceCheckUtils]: 31: Hoare triple {2020#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2020#false} is VALID [2018-11-14 18:59:26,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2018-11-14 18:59:26,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {2020#false} assume ~cond == 0; {2020#false} is VALID [2018-11-14 18:59:26,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2018-11-14 18:59:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 18:59:26,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:26,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 18:59:26,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-14 18:59:26,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:26,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:26,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:26,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:26,295 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-11-14 18:59:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,623 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2018-11-14 18:59:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:26,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-14 18:59:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-14 18:59:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-14 18:59:26,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-14 18:59:26,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:26,798 INFO L225 Difference]: With dead ends: 112 [2018-11-14 18:59:26,798 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 18:59:26,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-14 18:59:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 18:59:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-11-14 18:59:26,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:26,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 69 states. [2018-11-14 18:59:26,882 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 69 states. [2018-11-14 18:59:26,882 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 69 states. [2018-11-14 18:59:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,887 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-14 18:59:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-14 18:59:26,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:26,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:26,888 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 83 states. [2018-11-14 18:59:26,888 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 83 states. [2018-11-14 18:59:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,891 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-14 18:59:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-14 18:59:26,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:26,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:26,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:26,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 18:59:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-11-14 18:59:26,895 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 35 [2018-11-14 18:59:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:26,895 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-14 18:59:26,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-14 18:59:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 18:59:26,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:26,896 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:26,897 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:26,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -460105104, now seen corresponding path program 4 times [2018-11-14 18:59:26,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:26,906 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:26,906 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-14 18:59:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:59:26,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:59:26,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:26,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:27,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {2551#true} call ULTIMATE.init(); {2551#true} is VALID [2018-11-14 18:59:27,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {2551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2551#true} is VALID [2018-11-14 18:59:27,593 INFO L273 TraceCheckUtils]: 2: Hoare triple {2551#true} assume true; {2551#true} is VALID [2018-11-14 18:59:27,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2551#true} {2551#true} #105#return; {2551#true} is VALID [2018-11-14 18:59:27,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {2551#true} call #t~ret2 := main(); {2551#true} is VALID [2018-11-14 18:59:27,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {2551#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2551#true} is VALID [2018-11-14 18:59:27,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {2551#true} assume true; {2551#true} is VALID [2018-11-14 18:59:27,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {2551#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2577#(<= main_~j~0 0)} is VALID [2018-11-14 18:59:27,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {2577#(<= main_~j~0 0)} assume true; {2577#(<= main_~j~0 0)} is VALID [2018-11-14 18:59:27,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {2577#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2584#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {2584#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume true; {2584#(and (<= 0 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {2584#(and (<= 0 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2591#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-14 18:59:27,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {2591#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume true; {2591#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-14 18:59:27,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {2591#(and (<= main_~j~0 0) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2598#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {2598#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume true; {2598#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {2598#(and (<= 2 main_~k~0) (<= main_~j~0 0))} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} assume true; {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} assume !(~k~0 < ~n~0); {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} ~j~0 := ~j~0 + 1; {2615#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:27,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {2615#(and (<= 3 main_~n~0) (<= main_~j~0 1))} assume true; {2615#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:27,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {2615#(and (<= 3 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {2552#false} is VALID [2018-11-14 18:59:27,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {2552#false} ~i~0 := ~i~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {2552#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {2552#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {2552#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {2552#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {2552#false} assume !!(~k~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);~k~0 := ~k~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {2552#false} assume !(~k~0 < ~n~0); {2552#false} is VALID [2018-11-14 18:59:27,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {2552#false} ~j~0 := ~j~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {2552#false} assume !(~j~0 < ~n~0); {2552#false} is VALID [2018-11-14 18:59:27,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {2552#false} ~i~0 := ~i~0 + 1; {2552#false} is VALID [2018-11-14 18:59:27,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {2552#false} assume !(~i~0 < ~n~0); {2552#false} is VALID [2018-11-14 18:59:27,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {2552#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2552#false} is VALID [2018-11-14 18:59:27,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {2552#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2552#false} is VALID [2018-11-14 18:59:27,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {2552#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2552#false} is VALID [2018-11-14 18:59:27,617 INFO L273 TraceCheckUtils]: 45: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-14 18:59:27,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {2552#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4); {2552#false} is VALID [2018-11-14 18:59:27,618 INFO L256 TraceCheckUtils]: 47: Hoare triple {2552#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2552#false} is VALID [2018-11-14 18:59:27,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {2552#false} ~cond := #in~cond; {2552#false} is VALID [2018-11-14 18:59:27,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {2552#false} assume ~cond == 0; {2552#false} is VALID [2018-11-14 18:59:27,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {2552#false} assume !false; {2552#false} is VALID [2018-11-14 18:59:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 18:59:27,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 18:59:27,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-14 18:59:27,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:27,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:59:27,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:27,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:59:27,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:59:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:59:27,849 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 8 states. [2018-11-14 18:59:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:28,723 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2018-11-14 18:59:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:59:28,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-14 18:59:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-14 18:59:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-14 18:59:28,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 126 transitions. [2018-11-14 18:59:28,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:28,870 INFO L225 Difference]: With dead ends: 191 [2018-11-14 18:59:28,870 INFO L226 Difference]: Without dead ends: 143 [2018-11-14 18:59:28,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:59:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-14 18:59:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 108. [2018-11-14 18:59:29,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:29,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 108 states. [2018-11-14 18:59:29,027 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 108 states. [2018-11-14 18:59:29,027 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 108 states. [2018-11-14 18:59:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:29,034 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-11-14 18:59:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2018-11-14 18:59:29,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:29,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:29,035 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 143 states. [2018-11-14 18:59:29,035 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 143 states. [2018-11-14 18:59:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:29,040 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-11-14 18:59:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2018-11-14 18:59:29,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:29,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:29,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:29,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 18:59:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-11-14 18:59:29,046 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 51 [2018-11-14 18:59:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-11-14 18:59:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:59:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-11-14 18:59:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:59:29,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:29,048 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:29,048 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:29,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash -274466732, now seen corresponding path program 5 times [2018-11-14 18:59:29,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:29,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:29,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:29,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:29,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1