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.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:25:18,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:25:18,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:25:18,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:25:18,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:25:18,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:25:18,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:25:18,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:25:18,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:25:18,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:25:18,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:25:18,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:25:18,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:25:18,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:25:18,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:25:18,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:25:18,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:25:18,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:25:18,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:25:18,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:25:18,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:25:18,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:25:18,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:25:18,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:25:18,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:25:18,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:25:18,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:25:18,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:25:18,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:25:18,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:25:18,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:25:18,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:25:18,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:25:18,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:25:18,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:25:18,324 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:25:18,325 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:25:18,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:25:18,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:25:18,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:25:18,341 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:25:18,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:25:18,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:25:18,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:25:18,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:25:18,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:25:18,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:25:18,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:25:18,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:25:18,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:25:18,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:25:18,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:25:18,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:25:18,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:25:18,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:25:18,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:25:18,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:25:18,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:25:18,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:25:18,347 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:25:18,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:25:18,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:25:18,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:25:18,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:25:18,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:25:18,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:25:18,409 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:25:18,410 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:25:18,411 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-18 23:25:18,476 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4613a181d/f6cceecbb86143f181a7e1108314904b/FLAG5882a1061 [2018-11-18 23:25:18,884 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:25:18,885 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-3-u_true-unreach-call.i [2018-11-18 23:25:18,891 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4613a181d/f6cceecbb86143f181a7e1108314904b/FLAG5882a1061 [2018-11-18 23:25:19,261 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4613a181d/f6cceecbb86143f181a7e1108314904b [2018-11-18 23:25:19,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:25:19,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:25:19,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:25:19,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:25:19,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:25:19,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77612a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19, skipping insertion in model container [2018-11-18 23:25:19,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:25:19,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:25:19,593 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:25:19,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:25:19,636 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:25:19,668 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:25:19,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19 WrapperNode [2018-11-18 23:25:19,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:25:19,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:25:19,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:25:19,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:25:19,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (1/1) ... [2018-11-18 23:25:19,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:25:19,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:25:19,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:25:19,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:25:19,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25: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-18 23:25:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:25:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:25:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:25:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:25:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:25:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:25:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:25:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:25:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:25:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:25:20,472 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:25:20,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:20 BoogieIcfgContainer [2018-11-18 23:25:20,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:25:20,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:25:20,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:25:20,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:25:20,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:25:19" (1/3) ... [2018-11-18 23:25:20,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad5bd26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:20, skipping insertion in model container [2018-11-18 23:25:20,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:19" (2/3) ... [2018-11-18 23:25:20,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad5bd26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:20, skipping insertion in model container [2018-11-18 23:25:20,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:20" (3/3) ... [2018-11-18 23:25:20,481 INFO L112 eAbstractionObserver]: Analyzing ICFG init-3-u_true-unreach-call.i [2018-11-18 23:25:20,490 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:25:20,498 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:25:20,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:25:20,546 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:25:20,547 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:25:20,547 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:25:20,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:25:20,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:25:20,548 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:25:20,548 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:25:20,548 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:25:20,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:25:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-18 23:25:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:25:20,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:20,578 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-18 23:25:20,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:20,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 142166787, now seen corresponding path program 1 times [2018-11-18 23:25:20,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:20,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,673 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:20,674 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:20,674 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-18 23:25:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:20,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:21,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-18 23:25:21,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-18 23:25:21,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-18 23:25:21,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-18 23:25:21,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret2 := main(); {39#true} is VALID [2018-11-18 23:25:21,036 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(4 * ~n~0 * ~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-18 23:25:21,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-18 23:25:21,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-18 23:25:21,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:25:21,038 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-18 23:25:21,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:25:21,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-18 23:25:21,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:25:21,039 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {40#false} is VALID [2018-11-18 23:25:21,040 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-18 23:25:21,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-18 23:25:21,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-18 23:25:21,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-18 23:25:21,044 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-18 23:25:21,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:21,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:25:21,080 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:25:21,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:21,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:25:21,204 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-18 23:25:21,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:25:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:25:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:25:21,216 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-18 23:25:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:21,381 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-18 23:25:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:25:21,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:25:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:25:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:25:21,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-18 23:25:21,655 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-18 23:25:21,667 INFO L225 Difference]: With dead ends: 66 [2018-11-18 23:25:21,667 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:25:21,671 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-18 23:25:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:25:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:25:21,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:21,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:25:21,715 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:25:21,715 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:25:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:21,721 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:25:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:25:21,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:21,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:21,722 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:25:21,722 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:25:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:21,728 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:25:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:25:21,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:21,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:21,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:21,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:25:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-18 23:25:21,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-18 23:25:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:21,744 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-18 23:25:21,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:25:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:25:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:25:21,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:21,745 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-18 23:25:21,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:21,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash -914168140, now seen corresponding path program 1 times [2018-11-18 23:25:21,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:21,756 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:21,756 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:21,756 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-18 23:25:21,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:21,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:22,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-18 23:25:22,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {285#true} is VALID [2018-11-18 23:25:22,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-18 23:25:22,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #105#return; {285#true} is VALID [2018-11-18 23:25:22,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret2 := main(); {285#true} is VALID [2018-11-18 23:25:22,378 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(4 * ~n~0 * ~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-18 23:25:22,379 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-18 23:25:22,379 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-18 23:25:22,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {286#false} is VALID [2018-11-18 23:25:22,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:25:22,380 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-18 23:25:22,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:25:22,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {286#false} is VALID [2018-11-18 23:25:22,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:25:22,382 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {286#false} is VALID [2018-11-18 23:25:22,383 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-18 23:25:22,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2018-11-18 23:25:22,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} assume 0 == ~cond; {286#false} is VALID [2018-11-18 23:25:22,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-18 23:25:22,386 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-18 23:25:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:25:22,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:25:22,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:22,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:25:22,449 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-18 23:25:22,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:25:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:25:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:25:22,451 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-18 23:25:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:22,930 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 23:25:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:25:22,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:25:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:25:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:25:22,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-18 23:25:23,046 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-18 23:25:23,049 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:25:23,049 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:25:23,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:25:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:25:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-18 23:25:23,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:23,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2018-11-18 23:25:23,078 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2018-11-18 23:25:23,079 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2018-11-18 23:25:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,082 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 23:25:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 23:25:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:23,083 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2018-11-18 23:25:23,083 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2018-11-18 23:25:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,087 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 23:25:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 23:25:23,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:23,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:23,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:23,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:25:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-18 23:25:23,091 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2018-11-18 23:25:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:23,091 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-18 23:25:23,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:25:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-18 23:25:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:25:23,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:23,093 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-18 23:25:23,093 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:23,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash -934817045, now seen corresponding path program 1 times [2018-11-18 23:25:23,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:23,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:23,102 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:23,103 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:23,103 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-18 23:25:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:23,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:23,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-18 23:25:23,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {544#true} is VALID [2018-11-18 23:25:23,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-18 23:25:23,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #105#return; {544#true} is VALID [2018-11-18 23:25:23,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-18 23:25:23,368 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(4 * ~n~0 * ~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-18 23:25:23,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(<= 1000 main_~n~0)} assume true; {564#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:23,373 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-18 23:25:23,374 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-18 23:25:23,375 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-18 23:25:23,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {545#false} ~i~0 := 1 + ~i~0; {545#false} is VALID [2018-11-18 23:25:23,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-18 23:25:23,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !(~i~0 < ~n~0); {545#false} is VALID [2018-11-18 23:25:23,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {545#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {545#false} is VALID [2018-11-18 23:25:23,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-18 23:25:23,377 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-18 23:25:23,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-18 23:25:23,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {545#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {545#false} is VALID [2018-11-18 23:25:23,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {545#false} assume true; {545#false} is VALID [2018-11-18 23:25:23,378 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {545#false} is VALID [2018-11-18 23:25:23,378 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-18 23:25:23,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-18 23:25:23,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {545#false} assume 0 == ~cond; {545#false} is VALID [2018-11-18 23:25:23,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-18 23:25:23,381 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-18 23:25:23,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:23,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:23,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:25:23,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:23,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:23,454 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-18 23:25:23,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:23,455 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-18 23:25:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,747 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-18 23:25:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:23,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:25:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-18 23:25:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-18 23:25:23,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-18 23:25:23,883 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-18 23:25:23,887 INFO L225 Difference]: With dead ends: 72 [2018-11-18 23:25:23,887 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 23:25:23,888 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-18 23:25:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 23:25:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-18 23:25:23,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:23,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 37 states. [2018-11-18 23:25:23,934 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 37 states. [2018-11-18 23:25:23,935 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 37 states. [2018-11-18 23:25:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,939 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 23:25:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 23:25:23,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:23,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:23,941 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 47 states. [2018-11-18 23:25:23,941 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 47 states. [2018-11-18 23:25:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,944 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 23:25:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 23:25:23,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:23,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:23,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:23,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:25:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-18 23:25:23,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2018-11-18 23:25:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:23,949 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-18 23:25:23,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 23:25:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:25:23,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:23,950 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-18 23:25:23,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:23,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 119359556, now seen corresponding path program 1 times [2018-11-18 23:25:23,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:23,959 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:23,960 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:23,960 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-18 23:25:23,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:24,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:24,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-18 23:25:24,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-18 23:25:24,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-18 23:25:24,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #105#return; {864#true} is VALID [2018-11-18 23:25:24,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret2 := main(); {864#true} is VALID [2018-11-18 23:25:24,113 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(4 * ~n~0 * ~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-18 23:25:24,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#(<= 1000 main_~n~0)} assume true; {884#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:24,114 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-18 23:25:24,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(<= 1000 main_~n~0)} assume true; {884#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:24,140 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-18 23:25:24,141 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-18 23:25:24,143 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-18 23:25:24,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#false} ~j~0 := 1 + ~j~0; {865#false} is VALID [2018-11-18 23:25:24,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:25:24,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(~j~0 < ~n~0); {865#false} is VALID [2018-11-18 23:25:24,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#false} ~i~0 := 1 + ~i~0; {865#false} is VALID [2018-11-18 23:25:24,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:25:24,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#false} assume !(~i~0 < ~n~0); {865#false} is VALID [2018-11-18 23:25:24,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {865#false} is VALID [2018-11-18 23:25:24,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:25:24,146 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-18 23:25:24,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:25:24,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {865#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {865#false} is VALID [2018-11-18 23:25:24,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:25:24,147 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {865#false} is VALID [2018-11-18 23:25:24,147 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-18 23:25:24,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2018-11-18 23:25:24,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2018-11-18 23:25:24,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-18 23:25:24,150 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-18 23:25:24,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:24,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:24,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:25:24,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:24,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:24,214 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-18 23:25:24,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:24,215 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-11-18 23:25:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:24,440 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-18 23:25:24,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:24,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:25:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-18 23:25:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-18 23:25:24,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-18 23:25:24,638 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-18 23:25:24,641 INFO L225 Difference]: With dead ends: 74 [2018-11-18 23:25:24,641 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 23:25:24,642 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-18 23:25:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 23:25:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-18 23:25:24,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:24,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2018-11-18 23:25:24,704 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2018-11-18 23:25:24,704 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2018-11-18 23:25:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:24,708 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 23:25:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 23:25:24,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:24,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:24,710 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2018-11-18 23:25:24,710 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2018-11-18 23:25:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:24,713 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 23:25:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 23:25:24,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:24,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:24,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:24,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 23:25:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-18 23:25:24,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-18 23:25:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:24,718 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-18 23:25:24,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 23:25:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:25:24,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:24,719 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-18 23:25:24,720 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:24,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1885100254, now seen corresponding path program 1 times [2018-11-18 23:25:24,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:24,728 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:24,728 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:24,728 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-18 23:25:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:24,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:24,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {1205#true} call ULTIMATE.init(); {1205#true} is VALID [2018-11-18 23:25:24,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {1205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1205#true} is VALID [2018-11-18 23:25:24,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {1205#true} assume true; {1205#true} is VALID [2018-11-18 23:25:24,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1205#true} {1205#true} #105#return; {1205#true} is VALID [2018-11-18 23:25:24,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {1205#true} call #t~ret2 := main(); {1205#true} is VALID [2018-11-18 23:25:24,911 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(4 * ~n~0 * ~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-18 23:25:24,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#(<= 1000 main_~n~0)} assume true; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:24,912 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-18 23:25:24,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {1225#(<= 1000 main_~n~0)} assume true; {1225#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:24,913 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-18 23:25:24,914 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-18 23:25:24,916 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1245#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-18 23:25:24,917 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-18 23:25:24,918 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-18 23:25:24,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {1206#false} ~j~0 := 1 + ~j~0; {1206#false} is VALID [2018-11-18 23:25:24,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-18 23:25:24,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {1206#false} assume !(~j~0 < ~n~0); {1206#false} is VALID [2018-11-18 23:25:24,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {1206#false} ~i~0 := 1 + ~i~0; {1206#false} is VALID [2018-11-18 23:25:24,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-18 23:25:24,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {1206#false} assume !(~i~0 < ~n~0); {1206#false} is VALID [2018-11-18 23:25:24,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {1206#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1206#false} is VALID [2018-11-18 23:25:24,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-18 23:25:24,922 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-18 23:25:24,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-18 23:25:24,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {1206#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1206#false} is VALID [2018-11-18 23:25:24,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {1206#false} assume true; {1206#false} is VALID [2018-11-18 23:25:24,923 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1206#false} is VALID [2018-11-18 23:25:24,924 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-18 23:25:24,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {1206#false} ~cond := #in~cond; {1206#false} is VALID [2018-11-18 23:25:24,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#false} assume 0 == ~cond; {1206#false} is VALID [2018-11-18 23:25:24,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#false} assume !false; {1206#false} is VALID [2018-11-18 23:25:24,927 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-18 23:25:24,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:24,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:25:24,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:25:24,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:24,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:24,980 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-18 23:25:24,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:24,981 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-18 23:25:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,268 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-18 23:25:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:25,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:25:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-18 23:25:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-18 23:25:25,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2018-11-18 23:25:25,398 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-18 23:25:25,400 INFO L225 Difference]: With dead ends: 84 [2018-11-18 23:25:25,400 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 23:25:25,401 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-18 23:25:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 23:25:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-18 23:25:25,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:25,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-18 23:25:25,454 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-18 23:25:25,454 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-18 23:25:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,456 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-18 23:25:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 23:25:25,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:25,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:25,459 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-18 23:25:25,460 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-18 23:25:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,463 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-18 23:25:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 23:25:25,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:25,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:25,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:25,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 23:25:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-18 23:25:25,467 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2018-11-18 23:25:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:25,467 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-18 23:25:25,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 23:25:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 23:25:25,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:25,469 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-18 23:25:25,469 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:25,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2045138184, now seen corresponding path program 2 times [2018-11-18 23:25:25,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:25,478 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:25,478 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:25,479 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-18 23:25:25,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:25,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:25:25,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:25,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:25,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2018-11-18 23:25:25,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {1589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1589#true} is VALID [2018-11-18 23:25:25,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {1589#true} assume true; {1589#true} is VALID [2018-11-18 23:25:25,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1589#true} {1589#true} #105#return; {1589#true} is VALID [2018-11-18 23:25:25,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {1589#true} call #t~ret2 := main(); {1589#true} is VALID [2018-11-18 23:25:25,819 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(4 * ~n~0 * ~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-18 23:25:25,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {1609#(<= 1000 main_~n~0)} assume true; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:25,822 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-18 23:25:25,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {1609#(<= 1000 main_~n~0)} assume true; {1609#(<= 1000 main_~n~0)} is VALID [2018-11-18 23:25:25,825 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-18 23:25:25,825 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-18 23:25:25,827 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1629#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-18 23:25:25,827 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-18 23:25:25,828 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {1636#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-18 23:25:25,830 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-18 23:25:25,831 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-18 23:25:25,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {1590#false} ~j~0 := 1 + ~j~0; {1590#false} is VALID [2018-11-18 23:25:25,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-18 23:25:25,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {1590#false} assume !(~j~0 < ~n~0); {1590#false} is VALID [2018-11-18 23:25:25,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {1590#false} ~i~0 := 1 + ~i~0; {1590#false} is VALID [2018-11-18 23:25:25,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-18 23:25:25,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {1590#false} assume !(~i~0 < ~n~0); {1590#false} is VALID [2018-11-18 23:25:25,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {1590#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1590#false} is VALID [2018-11-18 23:25:25,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-18 23:25:25,834 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-18 23:25:25,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-18 23:25:25,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {1590#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1590#false} is VALID [2018-11-18 23:25:25,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {1590#false} assume true; {1590#false} is VALID [2018-11-18 23:25:25,835 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {1590#false} is VALID [2018-11-18 23:25:25,835 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-18 23:25:25,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {1590#false} ~cond := #in~cond; {1590#false} is VALID [2018-11-18 23:25:25,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {1590#false} assume 0 == ~cond; {1590#false} is VALID [2018-11-18 23:25:25,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2018-11-18 23:25:25,838 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-18 23:25:25,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:25,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:25:25,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-18 23:25:25,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:25,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:25:25,902 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-18 23:25:25,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:25:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:25:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:25,903 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-11-18 23:25:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,250 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-18 23:25:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:25:26,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-18 23:25:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-18 23:25:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-18 23:25:26,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2018-11-18 23:25:26,461 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-18 23:25:26,464 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:25:26,465 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 23:25:26,466 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-18 23:25:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 23:25:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-18 23:25:26,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:26,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-18 23:25:26,564 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-18 23:25:26,564 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-18 23:25:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,567 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-18 23:25:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-18 23:25:26,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:26,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:26,569 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-18 23:25:26,569 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-18 23:25:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,572 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-18 23:25:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-18 23:25:26,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:26,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:26,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:26,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 23:25:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-18 23:25:26,576 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 33 [2018-11-18 23:25:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:26,576 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-18 23:25:26,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:25:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-18 23:25:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:25:26,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:26,577 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-18 23:25:26,578 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 566943378, now seen corresponding path program 3 times [2018-11-18 23:25:26,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:26,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:26,587 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:26,588 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:26,588 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-18 23:25:26,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:25:26,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 23:25:26,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:26,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:26,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {2019#true} call ULTIMATE.init(); {2019#true} is VALID [2018-11-18 23:25:26,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {2019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2019#true} is VALID [2018-11-18 23:25:26,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {2019#true} assume true; {2019#true} is VALID [2018-11-18 23:25:26,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2019#true} {2019#true} #105#return; {2019#true} is VALID [2018-11-18 23:25:26,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {2019#true} call #t~ret2 := main(); {2019#true} is VALID [2018-11-18 23:25:26,801 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(4 * ~n~0 * ~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-18 23:25:26,802 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-18 23:25:26,802 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-18 23:25:26,817 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-18 23:25:26,818 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-18 23:25:26,819 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-18 23:25:26,820 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:25:26,820 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-18 23:25:26,821 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:25:26,821 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-18 23:25:26,822 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:25:26,823 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-18 23:25:26,824 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-18 23:25:26,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:25:26,825 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-18 23:25:26,826 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-18 23:25:26,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {2039#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {2088#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:25:26,828 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-18 23:25:26,829 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-18 23:25:26,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {2020#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-18 23:25:26,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-18 23:25:26,831 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-18 23:25:26,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-18 23:25:26,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2020#false} is VALID [2018-11-18 23:25:26,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-18 23:25:26,832 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2020#false} is VALID [2018-11-18 23:25:26,832 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-18 23:25:26,832 INFO L273 TraceCheckUtils]: 32: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2018-11-18 23:25:26,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {2020#false} assume 0 == ~cond; {2020#false} is VALID [2018-11-18 23:25:26,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2018-11-18 23:25:26,836 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-18 23:25:26,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-18 23:25:26,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-18 23:25:26,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:26,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:26,885 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-18 23:25:26,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:26,886 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-11-18 23:25:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:27,204 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2018-11-18 23:25:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:27,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-18 23:25:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-18 23:25:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-18 23:25:27,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-18 23:25:27,347 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-18 23:25:27,349 INFO L225 Difference]: With dead ends: 112 [2018-11-18 23:25:27,349 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 23:25:27,350 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-18 23:25:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 23:25:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-11-18 23:25:27,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:27,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 69 states. [2018-11-18 23:25:27,430 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 69 states. [2018-11-18 23:25:27,430 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 69 states. [2018-11-18 23:25:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:27,433 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-18 23:25:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-18 23:25:27,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:27,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:27,433 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 83 states. [2018-11-18 23:25:27,434 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 83 states. [2018-11-18 23:25:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:27,437 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-18 23:25:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-18 23:25:27,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:27,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:27,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:27,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 23:25:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-11-18 23:25:27,441 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 35 [2018-11-18 23:25:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:27,442 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-18 23:25:27,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-18 23:25:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 23:25:27,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:27,443 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-18 23:25:27,444 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:27,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash -460105104, now seen corresponding path program 4 times [2018-11-18 23:25:27,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:27,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:27,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:27,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:27,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:27,451 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-18 23:25:27,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:25:27,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:25:27,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:27,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:28,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {2551#true} call ULTIMATE.init(); {2551#true} is VALID [2018-11-18 23:25:28,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {2551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2551#true} is VALID [2018-11-18 23:25:28,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {2551#true} assume true; {2551#true} is VALID [2018-11-18 23:25:28,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2551#true} {2551#true} #105#return; {2551#true} is VALID [2018-11-18 23:25:28,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {2551#true} call #t~ret2 := main(); {2551#true} is VALID [2018-11-18 23:25:28,088 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(4 * ~n~0 * ~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-18 23:25:28,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {2551#true} assume true; {2551#true} is VALID [2018-11-18 23:25:28,089 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-18 23:25:28,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {2577#(<= main_~j~0 0)} assume true; {2577#(<= main_~j~0 0)} is VALID [2018-11-18 23:25:28,095 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-18 23:25:28,096 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-18 23:25:28,097 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2591#(and (<= main_~j~0 0) (<= 1 main_~k~0))} is VALID [2018-11-18 23:25:28,098 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-18 23:25:28,099 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2598#(and (<= 2 main_~k~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:28,100 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-18 23:25:28,108 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:28,109 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-18 23:25:28,110 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-18 23:25:28,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {2605#(and (<= 3 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {2615#(and (<= 3 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:28,111 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-18 23:25:28,112 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-18 23:25:28,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {2552#false} ~i~0 := 1 + ~i~0; {2552#false} is VALID [2018-11-18 23:25:28,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,112 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-18 23:25:28,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {2552#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2552#false} is VALID [2018-11-18 23:25:28,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,113 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2552#false} is VALID [2018-11-18 23:25:28,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,114 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2552#false} is VALID [2018-11-18 23:25:28,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,115 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4);~k~0 := 1 + ~k~0; {2552#false} is VALID [2018-11-18 23:25:28,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {2552#false} assume !(~k~0 < ~n~0); {2552#false} is VALID [2018-11-18 23:25:28,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {2552#false} ~j~0 := 1 + ~j~0; {2552#false} is VALID [2018-11-18 23:25:28,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {2552#false} assume !(~j~0 < ~n~0); {2552#false} is VALID [2018-11-18 23:25:28,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {2552#false} ~i~0 := 1 + ~i~0; {2552#false} is VALID [2018-11-18 23:25:28,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {2552#false} assume !(~i~0 < ~n~0); {2552#false} is VALID [2018-11-18 23:25:28,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {2552#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2552#false} is VALID [2018-11-18 23:25:28,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,118 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-18 23:25:28,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {2552#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2552#false} is VALID [2018-11-18 23:25:28,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {2552#false} assume true; {2552#false} is VALID [2018-11-18 23:25:28,119 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 * (4 * ~n~0 * ~n~0) + ~j~0 * (4 * ~n~0) + 4 * ~k~0, 4); {2552#false} is VALID [2018-11-18 23:25:28,119 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-18 23:25:28,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {2552#false} ~cond := #in~cond; {2552#false} is VALID [2018-11-18 23:25:28,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {2552#false} assume 0 == ~cond; {2552#false} is VALID [2018-11-18 23:25:28,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {2552#false} assume !false; {2552#false} is VALID [2018-11-18 23:25:28,125 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-18 23:25:28,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:28,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 23:25:28,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 23:25:28,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:28,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:25:28,195 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-18 23:25:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:25:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:25:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:25:28,196 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 8 states. [2018-11-18 23:25:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:29,220 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2018-11-18 23:25:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:25:29,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 23:25:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:25:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-18 23:25:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:25:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-18 23:25:29,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 126 transitions. [2018-11-18 23:25:29,390 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-18 23:25:29,393 INFO L225 Difference]: With dead ends: 191 [2018-11-18 23:25:29,394 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 23:25:29,395 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-18 23:25:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 23:25:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 108. [2018-11-18 23:25:29,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:29,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 108 states. [2018-11-18 23:25:29,549 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 108 states. [2018-11-18 23:25:29,549 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 108 states. [2018-11-18 23:25:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:29,555 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-11-18 23:25:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2018-11-18 23:25:29,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:29,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:29,557 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 143 states. [2018-11-18 23:25:29,557 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 143 states. [2018-11-18 23:25:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:29,562 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-11-18 23:25:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2018-11-18 23:25:29,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:29,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:29,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:29,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 23:25:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-11-18 23:25:29,568 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 51 [2018-11-18 23:25:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:29,568 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-11-18 23:25:29,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:25:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-11-18 23:25:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 23:25:29,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:29,570 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-18 23:25:29,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:29,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash -274466732, now seen corresponding path program 5 times [2018-11-18 23:25:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:29,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:29,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:29,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:29,578 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-18 23:25:29,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1