java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-multidimensional/add-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:58:46,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:58:46,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:58:46,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:58:46,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:58:46,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:58:46,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:58:46,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:58:46,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:58:46,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:58:46,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:58:46,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:58:46,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:58:46,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:58:46,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:58:46,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:58:46,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:58:46,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:58:46,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:58:46,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:58:46,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:58:46,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:58:46,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:58:46,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:58:46,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:58:46,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:58:46,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:58:46,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:58:46,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:58:46,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:58:46,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:58:46,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:58:46,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:58:46,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:58:46,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:58:46,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:58:46,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:58:46,520 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:58:46,520 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:58:46,524 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:58:46,524 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:58:46,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:58:46,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:58:46,525 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:58:46,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:58:46,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:58:46,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:58:46,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:58:46,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:58:46,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:58:46,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:58:46,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:58:46,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:58:46,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:58:46,530 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:58:46,530 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:58:46,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:58:46,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:58:46,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:58:46,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:58:46,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:58:46,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:58:46,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:58:46,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:58:46,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:58:46,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:58:46,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:58:46,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:58:46,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:58:46,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:58:46,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:58:46,611 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:58:46,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:58:46,612 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/add-3-n-u_true-unreach-call.i [2018-11-14 18:58:46,671 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844710903/55a319626dc44f3db499cad770fb5f27/FLAGad27702ff [2018-11-14 18:58:47,094 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:58:47,094 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/add-3-n-u_true-unreach-call.i [2018-11-14 18:58:47,107 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844710903/55a319626dc44f3db499cad770fb5f27/FLAGad27702ff [2018-11-14 18:58:47,121 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844710903/55a319626dc44f3db499cad770fb5f27 [2018-11-14 18:58:47,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:58:47,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:58:47,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:58:47,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:58:47,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:58:47,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb9594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47, skipping insertion in model container [2018-11-14 18:58:47,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:58:47,189 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:58:47,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:58:47,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:58:47,503 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:58:47,525 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:58:47,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47 WrapperNode [2018-11-14 18:58:47,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:58:47,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:58:47,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:58:47,527 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:58:47,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... [2018-11-14 18:58:47,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:58:47,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:58:47,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:58:47,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:58:47,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:58:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:58:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:58:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:58:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:58:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:58:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:58:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:58:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:58:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:58:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:58:48,754 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:58:48,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:58:48 BoogieIcfgContainer [2018-11-14 18:58:48,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:58:48,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:58:48,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:58:48,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:58:48,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:58:47" (1/3) ... [2018-11-14 18:58:48,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cb5cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:58:48, skipping insertion in model container [2018-11-14 18:58:48,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:58:47" (2/3) ... [2018-11-14 18:58:48,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cb5cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:58:48, skipping insertion in model container [2018-11-14 18:58:48,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:58:48" (3/3) ... [2018-11-14 18:58:48,764 INFO L112 eAbstractionObserver]: Analyzing ICFG add-3-n-u_true-unreach-call.i [2018-11-14 18:58:48,774 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:58:48,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:58:48,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:58:48,839 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:58:48,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:58:48,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:58:48,840 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:58:48,840 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:58:48,840 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:58:48,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:58:48,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:58:48,841 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:58:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 18:58:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:58:48,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:48,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:58:48,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:48,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1945566331, now seen corresponding path program 1 times [2018-11-14 18:58:48,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:48,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:48,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:48,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:48,968 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:48,968 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:48,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:49,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:49,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 18:58:49,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-14 18:58:49,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 18:58:49,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-14 18:58:49,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret7 := main(); {48#true} is VALID [2018-11-14 18:58:49,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {48#true} is VALID [2018-11-14 18:58:49,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 18:58:49,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:58:49,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-14 18:58:49,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:58:49,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:58:49,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 18:58:49,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:58:49,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {49#false} is VALID [2018-11-14 18:58:49,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 18:58:49,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {49#false} is VALID [2018-11-14 18:58:49,131 INFO L256 TraceCheckUtils]: 16: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {49#false} is VALID [2018-11-14 18:58:49,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-14 18:58:49,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume ~cond == 0; {49#false} is VALID [2018-11-14 18:58:49,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 18:58:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:58:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:58:49,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:58:49,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:58:49,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:49,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:58:49,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:49,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:58:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:58:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:58:49,296 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 18:58:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:49,529 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2018-11-14 18:58:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:58:49,529 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:58:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:58:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:58:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:58:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:58:49,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-14 18:58:50,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:50,382 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:58:50,383 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:58:50,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:58:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:58:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 18:58:50,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:50,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 18:58:50,452 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:58:50,452 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:58:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:50,458 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 18:58:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:58:50,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:50,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:50,459 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:58:50,460 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:58:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:50,468 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 18:58:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:58:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:50,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:50,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:58:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-14 18:58:50,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2018-11-14 18:58:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:50,480 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-14 18:58:50,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:58:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 18:58:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:58:50,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:50,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:58:50,482 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:50,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1304843137, now seen corresponding path program 1 times [2018-11-14 18:58:50,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:50,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:50,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:50,492 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:50,492 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:50,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:50,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:50,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-14 18:58:50,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-14 18:58:50,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-14 18:58:50,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #147#return; {354#true} is VALID [2018-11-14 18:58:50,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret7 := main(); {354#true} is VALID [2018-11-14 18:58:50,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:50,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:50,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {355#false} is VALID [2018-11-14 18:58:50,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:58:50,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:58:50,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#false} assume !(~i~0 < ~m~0); {355#false} is VALID [2018-11-14 18:58:50,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:58:50,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:58:50,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {355#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 18:58:50,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:58:50,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {355#false} is VALID [2018-11-14 18:58:50,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 18:58:50,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {355#false} is VALID [2018-11-14 18:58:50,763 INFO L256 TraceCheckUtils]: 18: Hoare triple {355#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {355#false} is VALID [2018-11-14 18:58:50,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {355#false} ~cond := #in~cond; {355#false} is VALID [2018-11-14 18:58:50,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {355#false} assume ~cond == 0; {355#false} is VALID [2018-11-14 18:58:50,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {355#false} assume !false; {355#false} is VALID [2018-11-14 18:58:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:58:50,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:58:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:58:50,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:58:50,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:50,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:58:50,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:50,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:58:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:58:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:58:50,845 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-14 18:58:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:51,152 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 18:58:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:58:51,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:58:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:58:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:58:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:58:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:58:51,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-14 18:58:51,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:51,434 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:58:51,434 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:58:51,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:58:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:58:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-14 18:58:51,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:51,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-14 18:58:51,467 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-14 18:58:51,467 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-14 18:58:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:51,471 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 18:58:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 18:58:51,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:51,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:51,472 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-14 18:58:51,472 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-14 18:58:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:51,476 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 18:58:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 18:58:51,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:51,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:51,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:51,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:58:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-14 18:58:51,480 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-14 18:58:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:51,481 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-14 18:58:51,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:58:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 18:58:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:58:51,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:51,482 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, 1, 1, 1] [2018-11-14 18:58:51,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:51,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash -272598018, now seen corresponding path program 1 times [2018-11-14 18:58:51,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:51,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:51,492 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:51,492 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:51,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:51,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:51,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 18:58:51,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 18:58:51,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 18:58:51,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #147#return; {676#true} is VALID [2018-11-14 18:58:51,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret7 := main(); {676#true} is VALID [2018-11-14 18:58:51,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {696#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:58:51,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= 1500 main_~n~0)} assume true; {696#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:58:51,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:58:51,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:58:51,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {677#false} is VALID [2018-11-14 18:58:51,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#false} ~i~0 := ~i~0 + 1; {677#false} is VALID [2018-11-14 18:58:51,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:58:51,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#false} assume !(~i~0 < ~m~0); {677#false} is VALID [2018-11-14 18:58:51,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:58:51,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:58:51,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {677#false} assume !(~i~0 < ~m~0); {677#false} is VALID [2018-11-14 18:58:51,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:58:51,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:58:51,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {677#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 18:58:51,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:58:51,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {677#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {677#false} is VALID [2018-11-14 18:58:51,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 18:58:51,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {677#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {677#false} is VALID [2018-11-14 18:58:51,821 INFO L256 TraceCheckUtils]: 23: Hoare triple {677#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {677#false} is VALID [2018-11-14 18:58:51,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#false} ~cond := #in~cond; {677#false} is VALID [2018-11-14 18:58:51,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#false} assume ~cond == 0; {677#false} is VALID [2018-11-14 18:58:51,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 18:58:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:58:51,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:58:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:58:51,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:58:51,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:51,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:58:51,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:51,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:58:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:58:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:51,896 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 4 states. [2018-11-14 18:58:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:52,215 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-14 18:58:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:58:52,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:58:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 18:58:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 18:58:52,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2018-11-14 18:58:52,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:52,404 INFO L225 Difference]: With dead ends: 98 [2018-11-14 18:58:52,404 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:58:52,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:58:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-14 18:58:52,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:52,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-14 18:58:52,477 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-14 18:58:52,477 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-14 18:58:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:52,482 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 18:58:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 18:58:52,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:52,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:52,484 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-14 18:58:52,484 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-14 18:58:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:52,488 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 18:58:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 18:58:52,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:52,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:52,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:52,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:58:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-14 18:58:52,492 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 27 [2018-11-14 18:58:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:52,493 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-14 18:58:52,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:58:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 18:58:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:58:52,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:52,494 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, 1, 1, 1] [2018-11-14 18:58:52,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1346161551, now seen corresponding path program 1 times [2018-11-14 18:58:52,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:52,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:52,503 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:52,503 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:52,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:52,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:52,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:52,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-14 18:58:52,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1089#true} is VALID [2018-11-14 18:58:52,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-14 18:58:52,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #147#return; {1089#true} is VALID [2018-11-14 18:58:52,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret7 := main(); {1089#true} is VALID [2018-11-14 18:58:52,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {1089#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:52,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {1109#(<= 1800 main_~p~0)} assume true; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:52,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:52,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(<= 1800 main_~p~0)} assume true; {1109#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:52,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {1109#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:52,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:52,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {1090#false} is VALID [2018-11-14 18:58:52,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} ~j~0 := ~j~0 + 1; {1090#false} is VALID [2018-11-14 18:58:52,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !(~j~0 < ~n~0); {1090#false} is VALID [2018-11-14 18:58:52,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} ~i~0 := ~i~0 + 1; {1090#false} is VALID [2018-11-14 18:58:52,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {1090#false} assume !(~i~0 < ~m~0); {1090#false} is VALID [2018-11-14 18:58:52,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:58:52,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} assume !(~i~0 < ~m~0); {1090#false} is VALID [2018-11-14 18:58:52,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:58:52,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {1090#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 18:58:52,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {1090#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1090#false} is VALID [2018-11-14 18:58:52,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 18:58:52,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {1090#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {1090#false} is VALID [2018-11-14 18:58:52,724 INFO L256 TraceCheckUtils]: 28: Hoare triple {1090#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1090#false} is VALID [2018-11-14 18:58:52,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-14 18:58:52,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {1090#false} assume ~cond == 0; {1090#false} is VALID [2018-11-14 18:58:52,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-14 18:58:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:58:52,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:58:52,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:58:52,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 18:58:52,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:52,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:58:52,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:52,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:58:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:58:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:52,784 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 4 states. [2018-11-14 18:58:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:53,026 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-11-14 18:58:53,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:58:53,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 18:58:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 18:58:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 18:58:53,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2018-11-14 18:58:53,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:53,218 INFO L225 Difference]: With dead ends: 101 [2018-11-14 18:58:53,219 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 18:58:53,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 18:58:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 18:58:53,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:53,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 18:58:53,289 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 18:58:53,289 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 18:58:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:53,293 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 18:58:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 18:58:53,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:53,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:53,294 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 18:58:53,295 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 18:58:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:53,298 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 18:58:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 18:58:53,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:53,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:53,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:53,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 18:58:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-14 18:58:53,302 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2018-11-14 18:58:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:53,303 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-14 18:58:53,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:58:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 18:58:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:58:53,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:53,304 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, 1, 1, 1] [2018-11-14 18:58:53,304 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:53,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1109010455, now seen corresponding path program 1 times [2018-11-14 18:58:53,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:53,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:53,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:53,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:53,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:53,313 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:53,313 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:53,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:53,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:53,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {1526#true} call ULTIMATE.init(); {1526#true} is VALID [2018-11-14 18:58:53,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {1526#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1526#true} is VALID [2018-11-14 18:58:53,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {1526#true} assume true; {1526#true} is VALID [2018-11-14 18:58:53,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} #147#return; {1526#true} is VALID [2018-11-14 18:58:53,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {1526#true} call #t~ret7 := main(); {1526#true} is VALID [2018-11-14 18:58:53,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {1526#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:53,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {1546#(<= 1800 main_~p~0)} assume true; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:53,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {1546#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:53,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= 1800 main_~p~0)} assume true; {1546#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:53,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:53,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:53,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:53,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:53,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {1566#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1527#false} is VALID [2018-11-14 18:58:53,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {1527#false} ~j~0 := ~j~0 + 1; {1527#false} is VALID [2018-11-14 18:58:53,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {1527#false} assume !(~j~0 < ~n~0); {1527#false} is VALID [2018-11-14 18:58:53,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {1527#false} ~i~0 := ~i~0 + 1; {1527#false} is VALID [2018-11-14 18:58:53,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#false} assume !(~i~0 < ~m~0); {1527#false} is VALID [2018-11-14 18:58:53,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 18:58:53,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {1527#false} assume !(~i~0 < ~m~0); {1527#false} is VALID [2018-11-14 18:58:53,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 18:58:53,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {1527#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 18:58:53,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {1527#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1527#false} is VALID [2018-11-14 18:58:53,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 18:58:53,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {1527#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {1527#false} is VALID [2018-11-14 18:58:53,564 INFO L256 TraceCheckUtils]: 30: Hoare triple {1527#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1527#false} is VALID [2018-11-14 18:58:53,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {1527#false} ~cond := #in~cond; {1527#false} is VALID [2018-11-14 18:58:53,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {1527#false} assume ~cond == 0; {1527#false} is VALID [2018-11-14 18:58:53,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {1527#false} assume !false; {1527#false} is VALID [2018-11-14 18:58:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:58:53,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:58:53,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:58:53,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 18:58:53,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:53,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:58:53,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:53,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:58:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:58:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:58:53,650 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 5 states. [2018-11-14 18:58:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:54,027 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-11-14 18:58:54,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:58:54,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 18:58:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:58:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 18:58:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:58:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 18:58:54,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2018-11-14 18:58:54,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:54,335 INFO L225 Difference]: With dead ends: 115 [2018-11-14 18:58:54,335 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 18:58:54,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:58:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 18:58:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-11-14 18:58:54,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:54,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 62 states. [2018-11-14 18:58:54,447 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 62 states. [2018-11-14 18:58:54,448 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 62 states. [2018-11-14 18:58:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:54,451 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 18:58:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 18:58:54,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:54,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:54,453 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 69 states. [2018-11-14 18:58:54,453 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 69 states. [2018-11-14 18:58:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:54,456 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 18:58:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 18:58:54,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:54,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:54,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:54,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:58:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-14 18:58:54,461 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 34 [2018-11-14 18:58:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:54,461 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-14 18:58:54,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:58:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-14 18:58:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:58:54,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:54,462 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, 1, 1, 1] [2018-11-14 18:58:54,463 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:54,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1702704579, now seen corresponding path program 2 times [2018-11-14 18:58:54,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:54,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:54,471 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:54,471 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:54,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:58:54,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:58:54,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:58:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:54,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:54,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {2019#true} call ULTIMATE.init(); {2019#true} is VALID [2018-11-14 18:58:54,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {2019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2019#true} is VALID [2018-11-14 18:58:54,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {2019#true} assume true; {2019#true} is VALID [2018-11-14 18:58:54,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2019#true} {2019#true} #147#return; {2019#true} is VALID [2018-11-14 18:58:54,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {2019#true} call #t~ret7 := main(); {2019#true} is VALID [2018-11-14 18:58:54,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {2019#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {2039#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {2039#(<= 1000 main_~m~0)} ~j~0 := ~j~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {2039#(<= 1000 main_~m~0)} ~i~0 := ~i~0 + 1; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {2039#(<= 1000 main_~m~0)} assume true; {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {2039#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {2039#(<= 1000 main_~m~0)} is VALID [2018-11-14 18:58:54,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {2039#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:54,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:54,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {2091#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2020#false} is VALID [2018-11-14 18:58:54,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {2020#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 18:58:54,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:58:54,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {2020#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 18:58:54,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:58:54,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2020#false} is VALID [2018-11-14 18:58:54,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 18:58:54,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {2020#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {2020#false} is VALID [2018-11-14 18:58:54,647 INFO L256 TraceCheckUtils]: 32: Hoare triple {2020#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2020#false} is VALID [2018-11-14 18:58:54,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2018-11-14 18:58:54,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#false} assume ~cond == 0; {2020#false} is VALID [2018-11-14 18:58:54,648 INFO L273 TraceCheckUtils]: 35: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2018-11-14 18:58:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:58:54,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:58:54,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:58:54,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:58:54,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:54,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:58:54,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:54,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:58:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:58:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:54,705 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 4 states. [2018-11-14 18:58:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:55,141 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2018-11-14 18:58:55,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:58:55,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:58:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 18:58:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 18:58:55,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2018-11-14 18:58:55,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:55,377 INFO L225 Difference]: With dead ends: 131 [2018-11-14 18:58:55,377 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 18:58:55,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 18:58:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-11-14 18:58:55,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:55,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 64 states. [2018-11-14 18:58:55,517 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 64 states. [2018-11-14 18:58:55,518 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 64 states. [2018-11-14 18:58:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:55,522 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 18:58:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 18:58:55,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:55,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:55,523 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 106 states. [2018-11-14 18:58:55,523 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 106 states. [2018-11-14 18:58:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:55,528 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 18:58:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 18:58:55,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:55,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:55,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:55,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:58:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-14 18:58:55,531 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 36 [2018-11-14 18:58:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:55,531 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-14 18:58:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:58:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-14 18:58:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 18:58:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:55,533 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:58:55,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 487964545, now seen corresponding path program 1 times [2018-11-14 18:58:55,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:55,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:58:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:55,542 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:55,542 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:55,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:55,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:55,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {2618#true} call ULTIMATE.init(); {2618#true} is VALID [2018-11-14 18:58:55,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {2618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2618#true} is VALID [2018-11-14 18:58:55,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {2618#true} assume true; {2618#true} is VALID [2018-11-14 18:58:55,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} #147#return; {2618#true} is VALID [2018-11-14 18:58:55,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {2618#true} call #t~ret7 := main(); {2618#true} is VALID [2018-11-14 18:58:55,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {2618#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:55,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(<= 1800 main_~p~0)} assume true; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:55,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {2638#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:55,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= 1800 main_~p~0)} assume true; {2638#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:55,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:55,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:55,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {2651#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:55,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:55,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {2658#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:58:55,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume true; {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:58:55,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {2665#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {2619#false} is VALID [2018-11-14 18:58:55,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 18:58:55,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#false} assume !(~i~0 < ~m~0); {2619#false} is VALID [2018-11-14 18:58:55,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {2619#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {2619#false} assume !(~k~0 < ~p~0); {2619#false} is VALID [2018-11-14 18:58:55,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,892 INFO L273 TraceCheckUtils]: 35: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 18:58:55,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 18:58:55,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {2619#false} assume !(~i~0 < ~m~0); {2619#false} is VALID [2018-11-14 18:58:55,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,893 INFO L273 TraceCheckUtils]: 40: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {2619#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,894 INFO L273 TraceCheckUtils]: 42: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 18:58:55,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 18:58:55,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {2619#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {2619#false} is VALID [2018-11-14 18:58:55,895 INFO L256 TraceCheckUtils]: 46: Hoare triple {2619#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2619#false} is VALID [2018-11-14 18:58:55,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {2619#false} ~cond := #in~cond; {2619#false} is VALID [2018-11-14 18:58:55,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {2619#false} assume ~cond == 0; {2619#false} is VALID [2018-11-14 18:58:55,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {2619#false} assume !false; {2619#false} is VALID [2018-11-14 18:58:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:58:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:58:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 18:58:55,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 18:58:55,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:55,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:58:55,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:55,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:58:55,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:58:55,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:58:55,980 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 6 states. [2018-11-14 18:58:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:56,762 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2018-11-14 18:58:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:58:56,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 18:58:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:58:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 18:58:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:58:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 18:58:56,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 132 transitions. [2018-11-14 18:58:56,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:56,903 INFO L225 Difference]: With dead ends: 132 [2018-11-14 18:58:56,903 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:58:56,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:58:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:58:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-11-14 18:58:57,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:57,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 72 states. [2018-11-14 18:58:57,259 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 72 states. [2018-11-14 18:58:57,260 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 72 states. [2018-11-14 18:58:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:57,262 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:58:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 18:58:57,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:57,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:57,263 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 76 states. [2018-11-14 18:58:57,263 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 76 states. [2018-11-14 18:58:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:57,266 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:58:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 18:58:57,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:57,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:57,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:57,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:58:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-11-14 18:58:57,269 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 50 [2018-11-14 18:58:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-14 18:58:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:58:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-14 18:58:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:58:57,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:57,270 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:58:57,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:57,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1369611969, now seen corresponding path program 2 times [2018-11-14 18:58:57,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:58:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:57,279 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:57,279 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:57,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:57,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:58:57,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:58:57,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:58:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:57,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:57,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2018-11-14 18:58:57,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {3215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3215#true} is VALID [2018-11-14 18:58:57,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {3215#true} assume true; {3215#true} is VALID [2018-11-14 18:58:57,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3215#true} {3215#true} #147#return; {3215#true} is VALID [2018-11-14 18:58:57,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {3215#true} call #t~ret7 := main(); {3215#true} is VALID [2018-11-14 18:58:57,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {3215#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:57,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {3235#(<= 1800 main_~p~0)} assume true; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:57,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {3235#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:57,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {3235#(<= 1800 main_~p~0)} assume true; {3235#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:58:57,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {3235#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:57,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:58:57,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {3248#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:57,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:58:57,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {3255#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:58:57,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume true; {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:58:57,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {3262#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 18:58:57,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume true; {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 18:58:57,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {3269#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {3216#false} is VALID [2018-11-14 18:58:57,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 18:58:57,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {3216#false} assume !(~i~0 < ~m~0); {3216#false} is VALID [2018-11-14 18:58:57,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {3216#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,787 INFO L273 TraceCheckUtils]: 29: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,789 INFO L273 TraceCheckUtils]: 32: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,790 INFO L273 TraceCheckUtils]: 36: Hoare triple {3216#false} assume !(~k~0 < ~p~0); {3216#false} is VALID [2018-11-14 18:58:57,790 INFO L273 TraceCheckUtils]: 37: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 18:58:57,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 18:58:57,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {3216#false} assume !(~i~0 < ~m~0); {3216#false} is VALID [2018-11-14 18:58:57,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {3216#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 18:58:57,793 INFO L273 TraceCheckUtils]: 48: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 18:58:57,793 INFO L273 TraceCheckUtils]: 49: Hoare triple {3216#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {3216#false} is VALID [2018-11-14 18:58:57,793 INFO L256 TraceCheckUtils]: 50: Hoare triple {3216#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {3216#false} is VALID [2018-11-14 18:58:57,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {3216#false} ~cond := #in~cond; {3216#false} is VALID [2018-11-14 18:58:57,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {3216#false} assume ~cond == 0; {3216#false} is VALID [2018-11-14 18:58:57,794 INFO L273 TraceCheckUtils]: 53: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2018-11-14 18:58:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 18:58:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:58:57,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 18:58:57,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 18:58:57,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:57,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:58:57,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:57,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:58:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:58:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:58:57,918 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2018-11-14 18:58:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:58,576 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-14 18:58:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:58:58,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 18:58:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:58:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 18:58:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:58:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 18:58:58,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-14 18:58:58,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:58,762 INFO L225 Difference]: With dead ends: 148 [2018-11-14 18:58:58,762 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:58:58,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:58:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:58:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-14 18:58:58,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:58:58,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2018-11-14 18:58:58,942 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2018-11-14 18:58:58,942 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2018-11-14 18:58:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:58,946 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 18:58:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 18:58:58,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:58,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:58,947 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2018-11-14 18:58:58,947 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2018-11-14 18:58:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:58,950 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 18:58:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 18:58:58,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:58:58,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:58:58,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:58:58,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:58:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:58:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-11-14 18:58:58,954 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 54 [2018-11-14 18:58:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:58:58,955 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-11-14 18:58:58,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:58:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-11-14 18:58:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:58:58,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:58:58,956 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:58:58,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:58:58,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:58:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash 799402753, now seen corresponding path program 3 times [2018-11-14 18:58:58,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:58:58,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:58:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:58,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:58:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:58:58,964 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:58:58,964 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:58:58,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:58:58,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:58:59,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:58:59,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:58:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:58:59,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:58:59,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {3877#true} call ULTIMATE.init(); {3877#true} is VALID [2018-11-14 18:58:59,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {3877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3877#true} is VALID [2018-11-14 18:58:59,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {3877#true} assume true; {3877#true} is VALID [2018-11-14 18:58:59,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3877#true} {3877#true} #147#return; {3877#true} is VALID [2018-11-14 18:58:59,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {3877#true} call #t~ret7 := main(); {3877#true} is VALID [2018-11-14 18:58:59,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {3877#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := ~j~0 + 1; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {3897#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:58:59,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {3952#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {3878#false} is VALID [2018-11-14 18:58:59,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {3878#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {3878#false} assume !(~k~0 < ~p~0); {3878#false} is VALID [2018-11-14 18:58:59,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {3878#false} ~j~0 := ~j~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {3878#false} assume !(~j~0 < ~n~0); {3878#false} is VALID [2018-11-14 18:58:59,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {3878#false} ~i~0 := ~i~0 + 1; {3878#false} is VALID [2018-11-14 18:58:59,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {3878#false} assume !(~i~0 < ~m~0); {3878#false} is VALID [2018-11-14 18:58:59,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {3878#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L273 TraceCheckUtils]: 53: Hoare triple {3878#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L256 TraceCheckUtils]: 54: Hoare triple {3878#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {3878#false} is VALID [2018-11-14 18:58:59,172 INFO L273 TraceCheckUtils]: 55: Hoare triple {3878#false} ~cond := #in~cond; {3878#false} is VALID [2018-11-14 18:58:59,173 INFO L273 TraceCheckUtils]: 56: Hoare triple {3878#false} assume ~cond == 0; {3878#false} is VALID [2018-11-14 18:58:59,173 INFO L273 TraceCheckUtils]: 57: Hoare triple {3878#false} assume !false; {3878#false} is VALID [2018-11-14 18:58:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-14 18:58:59,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:58:59,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 18:58:59,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 18:58:59,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:58:59,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:58:59,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:58:59,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:58:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:58:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:58:59,242 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 4 states. [2018-11-14 18:58:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:58:59,705 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2018-11-14 18:58:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:58:59,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 18:58:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:58:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 18:58:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:58:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 18:58:59,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2018-11-14 18:59:00,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:00,281 INFO L225 Difference]: With dead ends: 168 [2018-11-14 18:59:00,281 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 18:59:00,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 18:59:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 18:59:00,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:00,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 18:59:00,535 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 18:59:00,535 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 18:59:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:00,540 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 18:59:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 18:59:00,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:00,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:00,541 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 18:59:00,541 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 18:59:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:00,544 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 18:59:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 18:59:00,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:00,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:00,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:00,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 18:59:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-11-14 18:59:00,548 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 58 [2018-11-14 18:59:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:00,548 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-11-14 18:59:00,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-11-14 18:59:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 18:59:00,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:00,549 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:00,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:00,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash -511210103, now seen corresponding path program 4 times [2018-11-14 18:59:00,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:00,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:00,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:00,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:00,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:00,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:59:10,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:59:10,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:10,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:10,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {4663#true} call ULTIMATE.init(); {4663#true} is VALID [2018-11-14 18:59:10,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {4663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4663#true} is VALID [2018-11-14 18:59:10,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 18:59:10,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4663#true} {4663#true} #147#return; {4663#true} is VALID [2018-11-14 18:59:10,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {4663#true} call #t~ret7 := main(); {4663#true} is VALID [2018-11-14 18:59:10,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {4663#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~p~0 * 4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {4683#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:59:10,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {4683#(<= 1800 main_~p~0)} assume true; {4683#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:59:10,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {4683#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4683#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:59:10,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {4683#(<= 1800 main_~p~0)} assume true; {4683#(<= 1800 main_~p~0)} is VALID [2018-11-14 18:59:10,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {4683#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4696#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:10,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {4696#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume true; {4696#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-14 18:59:10,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {4696#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4703#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:10,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {4703#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume true; {4703#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-14 18:59:10,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {4703#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4710#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:10,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {4710#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume true; {4710#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-14 18:59:10,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {4710#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4717#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 18:59:10,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {4717#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume true; {4717#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-14 18:59:10,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {4717#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4724#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} is VALID [2018-11-14 18:59:10,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {4724#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} assume true; {4724#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} is VALID [2018-11-14 18:59:10,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {4724#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} assume !(~k~0 < ~p~0); {4664#false} is VALID [2018-11-14 18:59:10,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 18:59:10,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 35: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {4664#false} assume !(~k~0 < ~p~0); {4664#false} is VALID [2018-11-14 18:59:10,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {4664#false} assume !(~i~0 < ~m~0); {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {4664#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,285 INFO L273 TraceCheckUtils]: 45: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 48: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,287 INFO L273 TraceCheckUtils]: 54: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,287 INFO L273 TraceCheckUtils]: 55: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,288 INFO L273 TraceCheckUtils]: 56: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);havoc #t~mem2;havoc #t~mem3;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,288 INFO L273 TraceCheckUtils]: 58: Hoare triple {4664#false} assume !(~k~0 < ~p~0); {4664#false} is VALID [2018-11-14 18:59:10,288 INFO L273 TraceCheckUtils]: 59: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,288 INFO L273 TraceCheckUtils]: 60: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,289 INFO L273 TraceCheckUtils]: 61: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 18:59:10,289 INFO L273 TraceCheckUtils]: 62: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 18:59:10,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {4664#false} assume !(~i~0 < ~m~0); {4664#false} is VALID [2018-11-14 18:59:10,289 INFO L273 TraceCheckUtils]: 65: Hoare triple {4664#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,290 INFO L273 TraceCheckUtils]: 66: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,290 INFO L273 TraceCheckUtils]: 67: Hoare triple {4664#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,290 INFO L273 TraceCheckUtils]: 68: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,290 INFO L273 TraceCheckUtils]: 69: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 18:59:10,290 INFO L273 TraceCheckUtils]: 70: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 18:59:10,291 INFO L273 TraceCheckUtils]: 71: Hoare triple {4664#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (~p~0 * 4 * ~n~0) + ~j~0 * (~p~0 * 4) + ~k~0 * 4, 4); {4664#false} is VALID [2018-11-14 18:59:10,291 INFO L256 TraceCheckUtils]: 72: Hoare triple {4664#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {4664#false} is VALID [2018-11-14 18:59:10,291 INFO L273 TraceCheckUtils]: 73: Hoare triple {4664#false} ~cond := #in~cond; {4664#false} is VALID [2018-11-14 18:59:10,291 INFO L273 TraceCheckUtils]: 74: Hoare triple {4664#false} assume ~cond == 0; {4664#false} is VALID [2018-11-14 18:59:10,291 INFO L273 TraceCheckUtils]: 75: Hoare triple {4664#false} assume !false; {4664#false} is VALID [2018-11-14 18:59:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-14 18:59:10,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:10,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 18:59:10,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-11-14 18:59:10,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:10,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:59:10,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:59:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:59:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:59:10,383 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 8 states. [2018-11-14 18:59:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:11,197 INFO L93 Difference]: Finished difference Result 200 states and 232 transitions. [2018-11-14 18:59:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:59:11,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-11-14 18:59:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-14 18:59:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-14 18:59:11,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 150 transitions. [2018-11-14 18:59:11,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:11,493 INFO L225 Difference]: With dead ends: 200 [2018-11-14 18:59:11,493 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 18:59:11,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:59:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 18:59:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-14 18:59:12,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:12,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 108 states. [2018-11-14 18:59:12,021 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 108 states. [2018-11-14 18:59:12,021 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 108 states. [2018-11-14 18:59:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:12,025 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-11-14 18:59:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-11-14 18:59:12,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:12,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:12,026 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 112 states. [2018-11-14 18:59:12,026 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 112 states. [2018-11-14 18:59:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:12,029 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-11-14 18:59:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-11-14 18:59:12,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:12,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:12,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:12,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 18:59:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-11-14 18:59:12,034 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 76 [2018-11-14 18:59:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:12,034 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-11-14 18:59:12,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:59:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-11-14 18:59:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:59:12,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:12,036 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:12,036 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:12,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -120728977, now seen corresponding path program 5 times [2018-11-14 18:59:12,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:12,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:12,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:12,043 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:12,044 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:12,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:12,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1